Classical computers use bits, whilst quantum computers use quantum bits (qubits).Quantum computers can perform tasks that classical computers are unable to perform.When ideal quantum computers are developed, they will be a serious threat to current encryption systems.This has prompted the development of post-quantum cryptography.The National Institute of Standards and Technology (NIST) have selected four post-quantum algorithms.Three employ lattice-based cryptography, whilst one employs hash-based cryptography.Although recent attacks on lattice-based cryptography mean that the post-quantum algorithms of the future are uncertain.
Classical computers use bits, whilst quantum computers use quantum bits (qubits).Quantum computers can perform tasks that classical computers are unable to perform.When ideal quantum computers are developed, they will be a serious threat to current encryption systems.This has prompted the development of post-quantum cryptography.The National Institute of Standards and Technology (NIST) have selected four post-quantum algorithms.Three employ lattice-based cryptography, whilst one employs hash-based cryptography.Although recent attacks on lattice-based cryptography mean that the post-quantum algorithms of the future are uncertain.
Classical computers use bits, whilst quantum computers use quantum bits (qubits).Quantum computers can perform tasks that classical computers are unable to perform.When ideal quantum computers are developed, they will be a serious threat to current encryption systems.This has prompted the development of post-quantum cryptography.The National Institute of Standards and Technology (NIST) have selected four post-quantum algorithms.Three employ lattice-based cryptography, whilst one employs hash-based cryptography.Although recent attacks on lattice-based cryptography mean that the post-quantum algorithms of the future are uncertain.
The advent of quantum computing poses a significant threat to current cryptographic systems, particularly public-key algorithms such as RSA and ECC, which are vulnerable to quantum attacks like Shor's algorithm. Post-Quantum Cryptography (PQC) aims to develop and standardize quantum-resistant cryptographic algorithms to secure digital communications in the quantum era. This paper examines the current landscape of PQC, focusing on the evaluation and standardization efforts led by organizations such as the National Institute of Standards and Technology (NIST). We analyze the major families of quantum-resistant algorithms, including lattice-based, hash-based, code-based, multivariate, and isogeny-based cryptography, discussing their security guarantees, performance trade-offs, and implementation challenges. Furthermore, we review NIST's PQC standardization process, highlighting selected finalists and alternate candidates, and explore the ongoing transition challenges in adopting these algorithms across industries. Finally, we discuss future directions for PQC research, including hybrid cryptographic systems and the need for continued cryptanalysis to ensure long-term security. This work provides a comprehensive overview of the progress and challenges in deploying quantum-resistant cryptography to safeguard against emerging quantum threats.
The emergence of quantum computing poses a serious threat to traditional communication systems, endangering the security of digital communications and critical infrastructure. Although existing cryptographic algorithms (such as RSA and ECC) rely on the inefficiency of computing large numbers or solving logarithm inequality problems, quantum algorithms (especially Shor's algorithm) can solve these problems efficiently. To mitigate this threat, the field of post-quantum cryptography (PQC) has emerged and focuses on developing cryptographic systems that are resilient to quantum attacks. The main techniques in PQC include lattice-based, hash-based, code-based, and multivariate polynomial cryptography. Lattice-based cryptography is the leading contender, providing high security and supporting good properties such as fully homomorphic encryption, but facing issues related to size and computational efficiency. Hash-based encryption enables strong digital signatures but has limitations. Code-based encryption based on error-correcting codes provides proof of security but requires small size. Multivariate polynomial cryptography has good performance but has drawbacks in some applications. While standardization efforts led by organizations such as NIST continue, PQC is at the forefront of protecting the digital future from the impact of quantum computing, ensuring the integrity and confidentiality of information in the post-quantum era.
The process of selecting post-quantum cryptography algorithms for standardization based on parameters proposed by the National Institute of Standards and Technology (NIST) is described. The resistance of post-quantum cryptography algorithms to attacks by classical and quantum computers is assessed, taking into account their specific features. The different numbers of operations for attacks by quantum and classical computers are substantiated. The parallelization potential of post-quantum cryptography algorithms is analyzed. It is noted that, despite the proposed use of quantum computers, the primary goal of cryptography is the application of algorithms based on problems that are not reducible to problems of P-class complexity.
Abstract It is viewed as revolutionary technology, offering incredible potential in terms of computing power within different scientific and industrial sectors. Quantum computers provide remarkable computing power; however, they also present significant security risks to existing public-key cryptography systems used to secure digital communication, online banking systems, government, medical applications, cloud computing systems, and IoT systems. Security of commonly used encryption schemes like RSA, DH, and ECC depends on mathematical problems that are impossible for classical computers to solve but can be easily resolved with the help of powerful enough quantum computers by using Shor’s algorithm. Furthermore, Grover’s algorithm makes exhaustive search attacks much faster, thus effectively lowering the security level of symmetric encryption schemes since it provides the speed-up for brute-force attacks. Post-Quantum Cryptography (PQC) turned out to be an effective and scalable method to protect digital data from attacks using quantum computing. In contrast to quantum cryptography, which requires a special quantum communication channel, PQC uses classical cryptographic algorithms that cannot be broken down by either classical or quantum computer due to certain mathematical problems. This research paper offers an extensive exploration of post-quantum cryptography through the analysis of the development of quantum computing, weaknesses of current cryptographic techniques, and mathematics behind quantum-resistant algorithms. Moreover, this paper explores the major classes of PQC techniques such as lattice-based, code-based, hash-based, multivariate, and isogeny-based cryptography and provides details about their security and application. Moreover, the report gives an overview of the NIST Post-Quantum Cryptography Standardization Project and analyzes recent standardizations of quantum-proof algorithms to be utilized in future digital infrastructures. Keywords: Post-Quantum Encryption, Quantum Security, Quantum-Proof Public-Key Cryptography, Lattice-Based Security Protocols, ML-KEM Key Encapsulation Mechanism, ML-DSA Digital Signature Algorithm, NIST Post-Quantum Cryptography, Contemporary Cybersecurity, Secure Communications, Cryptographic Algorithms.