Currently deployed public-key infrastructure faces an imminent threat in the face of quantum computers. It is expected that, given sufficiently large and reliable quantum computers, dedicated quantum algorithms such as Shor's algorithm [1] will completely break cryptographic schemes whose security is based on the discrete logarithm and integer factorisation problems. This includes widely deployed cryptographic algorithms such as RSA, Diffie-Hellman and elliptic-curve based approaches which underpin the security of existing electronic communications. Therefore, the secrecy of highly sensitive information currently being exchanged is under significant threat as messages can be recorded in bulk and decrypted in the future in so-called harvest-and-decrypt attacks.
Currently deployed public-key infrastructure faces an imminent threat in the face of quantum computers. It is expected that, given sufficiently large and reliable quantum computers, dedicated quantum algorithms such as Shor's algorithm [1] will completely break cryptographic schemes whose security is based on the discrete logarithm and integer factorisation problems. This includes widely deployed cryptographic algorithms such as RSA, Diffie-Hellman and elliptic-curve based approaches which underpin the security of existing electronic communications. Therefore, the secrecy of highly sensitive information currently being exchanged is under significant threat as messages can be recorded in bulk and decrypted in the future in so-called harvest-and-decrypt attacks.
The rapid growth of quantum computing poses a critical threat to classical cryptographic systems. That is due in large part to the fact that they represent efficient solutions for some of the most challenging mathematical problems such as integer factoring or finding discrete logarithms. Schemes currently in wide use including RSA, Diffie–Hellman, and elliptic curve cryptography are particularly susceptible to being attacked by quantum computers, using algorithms like Shor's Algorithm and Grover's Algorithm. The advent of post-quantum cryptography (PQC) provides a promising potential answer to providing longterm security from adversaries using quantum computing capabilities. This paper presents a comprehensive state-of-the-art review of various PQC techniques currently being researched, including lattice-based methods, code-based methods, multivariate methods, hash-based methods, and isogeny-based methods. key challenges that will need to be addressed include computational overhead, large key sizes and implementation complexity. Furthermore the study reviews the current standardization efforts by the National Institute of Standards and Technology related to PQC and discusses some of the very specific practical considerations that need to be considered before widely deploying these techniques. The paper concludes by a complete list of existing research challenges and proposed future work that will assist in the development of efficient and scalable systems that will resist attacks from quantum computers.
Large quantum computers will be able to break the cryptographic algorithms on which current secure communications rely on. Post-Quantum Cryptography (PQC) and Quantum key distribution (QKD) are two security technologies that show protection capabilities against the latent quantum threat. While PQC relies on different hard mathematical problems to develop a wide variety of cryptographic operations, QKD is based on quantum physics laws to generate and distribute symmetric cryptographic keys through different QKD protocols. These keys can be used by different applications to perform security transformations. QKD still requires authentication to prevent man-in-the-middle attacks. The hybridization of PQC and QKD is an important step for future secure infrastructures, being able to provide long-term security. In this work we propose authenticated QKD approaches that rely on pre-shared keys and hybrid PQC/QKD alternatives and which are able to securely exchange secret QKD keys through authenticated channels. We identify the different configuration alternatives and their parameters, as well as we develop a wide performance evaluation. Results show that pre-shared keys and PQC-based authentication through Dilithium algorithm are the fastest alternatives. Also, we show the potential of the T12 QKD protocol.
The potential of the swift development of quantum computing is an extreme danger to the traditional cryptographic programs, and they are the foundation of the modern communication infrastructure. RSA and ECC are classical public-key algorithms that can be successfully quantum-attacked, in particular, Shor's algorithm can easily factor large integers and calculate discrete logarithms (Bernstein et al., 2017). The Post-Quantum Cryptography (PQC) has become the key to secure the next-generation communication networks against these threats, which relies on lattice problem-based algorithms, hash-based based algorithms, multivariate polynomials-based algorithms, and code-based cryptography. The paper examines the concepts, design, and implementation issues of PQC within current network infrastructure focusing on the secure transmission of data, authentication, and key management in the upcoming 5G and 6G networks. The approach will include the survey of existing algorithms of PQC, model the integration of protocol in the communication systems and test computational efficiency, security strength, and scalability. It has been found that PQC is suitable to protect network communications against quantum attackers, and achieves reasonable performance, though trade-offs can be seen in terms of computation overhead, key size, and latency. The research offers understanding to the researcher, network engineers and policy makers in order to adopt quantum resistant cryptography protocols to secure the confidentiality, integrity and authenticity of information in the future communication networks.
The advent of quantum computing poses a significant threat to the foundational cryptographic algorithms that secure modern digital communications. [27]. Protocols such as HTTPS, digital certificates, and public key infrastructures (PKIs) heavily rely on cryptographic primitives like RSA, ECC, and Diffie-Hellman, which are vulnerable to quantum attacks—most notably Shor’s algorithm. [18]. This paper presents a comprehensive comparative analysis between classical cryptographic algorithms currently in widespread use and emerging post-quantum cryptographic schemes designed to withstand quantum adversaries. [24]. We review the cryptographic mechanisms underpinning modern internet security, outline the mathematical foundations of quantum attacks, and evaluate the security, performance, and implementation feasibility of quantum-resistant alternatives such as Kyber, Dilithium, and Falcon. [25]. Additionally, we assess the hybrid approaches currently being explored by institutions and tech companies to enable a smooth transition to post-quantum cryptography. [23]. By providing an in-depth comparison, this study aims to guide researchers, developers, and policymakers in understanding the critical implications of quantum computing on cryptographic infrastructures and the necessary steps for securing communications in the quantum era. [16].
The current technological advancements in quantum computing pose a threat to traditional key exchange protocols such as Rivest-Shamir-Adleman (RSA), Diffie-Hellman (DH), and Elliptic Curve Diffie-Hellman (ECDH). One of the most important quantum algorithms is Shor's algorithm, which can easily defeat traditional approaches that rely on complex mathematical computations. Instead, the security of the key exchange protocol is provided by quantum cryptographic applications known as quantum key distribution (QKD) protocols, which are based on quantum mechanical principles. QKD provides a secure substitute for key exchange. This paper examines the security of both traditional and quantum key exchange techniques. Using simulation tools such as Qiskit and NetSquid, we model QKD-based communication channels and analyze key rate performance, error rates, and scalability in comparison to classical cryptographic techniques. This paper introduces the emergence of current quantum safe encryption techniques by offering a standardized comparison of key exchange protocols and their applicability to future secure networks. The insights derived from our simulations provide valuable guidance for researchers, industry practitioners, and policymakers in determining the optimal path toward quantum-secure communication infrastructures.
With the arrival of fault-tolerant quantum computers, an existential threat has come to the cryptographic underpinnings of the security infrastructure in place for modern information technologies. Virtually all secure digital communication protocols used today are based on classical public-key cryptographic systems – RSA, Elliptic Curve Cryptography (ECC) and Diffie-Hellman key exchange – that are susceptible to polynomial-time quantum attacks using Shor's algorithm. Symmetric cryptographic algorithms that are not broken are being effectively halved by Grover's algorithm, for example, AES. In this article, a complete and journal-standard systematic review of quantum computing and its implications in the field of information technology security is presented which includes 22 peer-reviewed publications from 2023-2025. The study covers the basics of quantum computing (qubits, superposition, entanglement and quantum gates), and how quantum computing specifically poses a threat to classical cryptography via algorithmic mechanisms. The three post-quantum cryptographic algorithms that were standardised by the National Institute of Standards and Technology (NIST) in August 2024 (ML-KEM, FIPS 203; ML-DSA, FIPS 204; and SLH-DSA, FIPS 205) are compared based on their security assumptions, performance, and readiness for deployment. The practical limitations and the use of Quantum Key Distribution, (QKD), as a physics based alternative to the computational security assumptions are discussed. Results show that although mature PQ solutions are now available for most cryptographic applications, the migration challenge, including legacy system transitions, migration architecture, and governance, is significant and pressing as the ‘harvest now, decrypt later’ threat model is relevant and adversaries might be collecting encrypted data for quantum decryption. The impact for financial services, health care, government, cloud infrastructure and critical national infrastructure is discussed. Lastly, the researchers list key research areas: standardisation of quantum-safe protocols, hybrid PQC-QKD designs, light-weight PQC for constrained devices, and quantum-safe blockchain.