Recent advances in cryptography aim to address threats posed by quantum computers. However, these advances have focused disproportionately on asymmetric schemes, while symmetric primitives like block ciphers have received less attention. The common assumption is that doubling block cipher key sizes provides adequate quantum resistance, but this oversimplifies the challenge. This paper provides a systematic examination of block cipher security in the quantum computing era. The paper first establishes a formal framework for understanding block cipher security, covering their mathematical foundations and essential security properties. Building on this foundation, we examine how quantum computing fundamentally challenges these security assumptions, going beyond the simple impact on key lengths. Our review of recent research reveals that quantum attacks can exploit structural vulnerabilities in block ciphers and their modes of operation, requiring more comprehensive defenses than key length adjustments alone. We analyze emerging approaches in quantum-resistant design and identify critical areas requiring further research to ensure block cipher security in a post-quantum world.
Recent advances in cryptography aim to address threats posed by quantum computers. However, these advances have focused disproportionately on asymmetric schemes, while symmetric primitives like block ciphers have received less attention. The common assumption is that doubling block cipher key sizes provides adequate quantum resistance, but this oversimplifies the challenge. This paper provides a systematic examination of block cipher security in the quantum computing era. The paper first establishes a formal framework for understanding block cipher security, covering their mathematical foundations and essential security properties. Building on this foundation, we examine how quantum computing fundamentally challenges these security assumptions, going beyond the simple impact on key lengths. Our review of recent research reveals that quantum attacks can exploit structural vulnerabilities in block ciphers and their modes of operation, requiring more comprehensive defenses than key length adjustments alone. We analyze emerging approaches in quantum-resistant design and identify critical areas requiring further research to ensure block cipher security in a post-quantum world.
The development of quantum computers represents an important advancement in computing, using quantum mechanics to address problems that were previously difficult to solve. This technological advancement poses a challenge for cryptographic systems. While some methods are known to be vulnerable, the impact of quantum computing on symmetric cryptography has received less research attention, largely because the common advice is to simply double the key size. This paper explores how quantum computing affects symmetric cryptography, focusing on block cipher-based cryptography. It surveys existing literature on the quantum resilience of symmetric cryptographic primitives based on block ciphers and their security in various scenarios. Not all symmetric cryptographic functionalities are quantum-secure, and their security depends on the specific adversary model being considered. We provide an overview of the research conducted and pinpoint areas where further investigation is needed.
The emergence of a new era of quantum computing is on the horizon, presenting modern cryptography with a cluster of unprecedented threats.This review delves into the cryptographic techniques that risk being challenged in a postquantum environment and the algorithms that challenge these techniques.We first investigate aspects of traditional cryptography, covering both asymmetric and symmetric cryptography.Then, we analyze quantum computing and its impact on cryptographic techniques, notably Shor's and Grover's algorithms.Finally, we will research quantum-resistant solutions and explore our current status in post-quantum cryptography.This review aims to provide a comprehensive understanding of the threats posed by quantum computing from a cryptographic standpoint and the approaches available to mitigate these risks for a more secure future.
Block ciphers are versatile cryptographic ingredients that are used in a wide range of applications ranging from secure Internet communications to disk encryption. While post-quantum security of public-key cryptography has received significant attention, the case of symmetric-key cryptography (and block ciphers in particular) remains a largely unexplored topic. In this work, we set the foundations for a theory of post-quantum security for block ciphers and associated constructions. Leveraging our new techniques, we provide the first post-quantum security proofs for the key-length extension scheme FX, the tweakable block ciphers LRW and XEX, and most block cipher encryption and authentication modes. Our techniques can be used for security proofs in both the plain model and the quantum ideal cipher model. Our work takes significant initial steps in establishing a rigorous understanding of the post-quantum security of practical symmetric-key cryptography.
The rapid advancement of quantum computing poses a significant threat to classical cryptographic systems that rely on the computational hardness of mathematical problems such as integer factorization and discrete logarithm problems. In this context, quantum cryptography has emerged as a promising paradigm for secure communication based on the fundamental principles of quantum mechanics rather than on computational assumptions. This paper presents a comprehensive review of quantum cryptography, with a particular focus on Quantum Key Distribution (QKD), the most mature application. The study discusses the theoretical foundations of quantum security, including superposition, entanglement, and the No-cloning theorem, which collectively enable eavesdropping detection and guarantee information-theoretic security. Furthermore, the review examines major QKD protocols, such as BB84 and E91, as well as their advanced variants designed to address practical vulnerabilities and enhance performance. Recent progress in real-world implementations, including fiber-optic networks, free-space communication, and satellite-based systems such as the Micius satellite, is also analyzed. In addition, the paper highlights critical challenges related to scalability, hardware limitations, and security loopholes arising from imperfect devices. Finally, emerging research directions, including hybrid cryptographic frameworks that integrate quantum and post-quantum approaches, are discussed to provide insights into the future of secure communication. This review aims to provide a structured, up-to-date understanding of quantum cryptography, bridging the gap between theoretical developments and practical implementations, and emphasizing its crucial role in shaping next-generation cybersecurity systems.
With the rapid advancement regarding quantum computing, traditional cryptographic systems face an existential threat because of their reliance concerning mathematical challenges which may be addressed effectively solved using quantum algorithms like the one developed by Shor. This imminent risk has driven extensive research into quantum-resistant cryptography (PQC), that seeks to develop encryption methods resilient against attacks powered by quantum computing. This study offers a thorough literature survey on high-level security techniques in quantum security for PQC, analysing past and current research efforts in this domain. We first examine the vulnerabilities of classical cryptographic protocols, including public-key encryption methods such as RSA (developed by Rivest, Shamir, and Adleman) and ECC (which uses elliptic curve mathematics), and traditional cryptographic hashing methods, against quantum adversaries. The study then explores the foundational approaches to quantum-secure cryptography, including lattice-based, hash-based, multivariate polynomial, code-based, and isogeny-based encryption methods that possess emerged as promising candidates for standardization. The survey highlights key challenges in the real-world application of PQC, including performance trade-offs, key size overhead, and deployment complexities. We conclude by identifying future research directions during the creation of scalable, efficient, and provably secure cryptographic methods designed to withstand quantum attacks techniques. As the shift toward the quantum-resilient era approaches, this survey aims to provide a clear and structured comprehension of the evolving the domain of quantum security for PQC.
The advent of quantum computing represents a transformative leap in computational power, offering the potential to solve complex problems beyond the reach of classical computers. However, this power also presents significant cybersecurity risks, as quantum algorithms can potentially break widely used encryption methods, jeopardizing data privacy and secure communications. This paper presents a comprehensive review of emerging quantum-related cybersecurity threats and explores defense mechanisms designed to mitigate these risks. We examine both theoretical and real-world implications of quantum computing on cryptographic systems, highlighting recent developments in post-quantum cryptography, Quantum Key Distribution (QKD), and hybrid classical-quantum security solutions. This review aims to provide a foundational understanding of the threats quantum computing poses to cybersecurity and discusses current and future defenses essential for safeguarding digital infrastructure.