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.
Authenticated key exchange mechanisms instantiated with cryptosystems
based on integer factorization, finite field discrete log, or elliptic
curve discrete log, are believed to be secure now but are vulnerable
to a harvest-then-decrypt attack where an attacker who cannot
currently break the mechanism records the traffic anyway, then
decrypts it at some point in the future when quantum computers become
available. The Quantum-safe Hybrid approach is a modular design,
allowing any authenticated key exchange mechanism to be protected
against the harvest-then-decrypt attack by exchanging additional
secret material protected with an ephemeral key for a quantum-safe
public key cryptographic algorithm and including that secret material
in the Key Derivation Function (KDF) run at the end of the key
exchange. This approach has been proposed in TLS as the Quantum-safe
Hybrid handshake mechanism for Transport Layer Security protocol
(QSH_TLS). This document provides a guideline to criteria for
selecting public key encryption algorithms approved for experimental
use in the quantum safe hybrid setting.
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 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.
The defense of public key cryptography (PKC) lies in computational issues like the difficulty of factorizing enormous prime numbers and the discrete logarithm calculations. Such kinds of algorithms are called one-way functions because although it is straightforward to compute output given input, it is difficult to compute input if output is given. It is expected that such numerical or computational issues which are utilized in current cryptographic plans are difficult to address for an adversary utilizing present PCs. Yet, many organizations are attempting to assemble a high-powered quantum PC and in the future quantum PCs will be available for business use. Traditional asymmetric cryptographic algorithms are not secure against strong quantum machines. Shor’s algorithm running on a powerful quantum PC is able to solve integer factorization problems and discrete logarithm problems in polynomial time. So, asymmetric algorithms that are used today, like RSA, DSA and Diffie-Hellman will become insecure. Similarly, Grover’s algorithm running on a powerful quantum computer poses a serious threat to symmetric key algorithms which uses small key size. There is a need to work on alternate algorithms to resist quantum threat. NIST has already started with a process for the standardization of algorithms which are known as post-quantum cryptography (PQC) algorithms. Specialists globally are exploring progress toward post-quantum cryptography.