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.
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.
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.
In recent years, there has been steady progress in the creation of quantum computers. If large-scale quantum computers are implemented, they will threaten the security of many widely used public-key cryptosystems. Key-establishment schemes and digital signatures based on factorization, discrete logarithms, and elliptic curve cryptography will be most affected. Symmetric cryptographic primitives such as block ciphers and hash functions will be broken only slightly. As a result, there has been an intensification of research on finding public-key cryptosystems that would be secure against cryptanalysts with both quantum and classical computers. This area is often called post-quantum cryptography (PQC), or sometimes quantum-resistant cryptography. The goal is to design schemes that can be deployed in existing communication networks and protocols without significant changes. The National Institute of Standards and Technology is in the process of selecting one or more public-key cryptographic algorithms through an open competition. New public-key cryptography standards will define one or more additional digital signatures, public-key encryption, and key-establishment algorithms. It is assumed that these algorithms will be able to protect confidential information well in the near future, including after the advent of quantum computers. After three rounds of evaluation and analysis, NIST has selected the first algorithms that will be standardized as a result of the PQC standardization process. The purpose of this article is to review and analyze the state of NIST's post-quantum cryptography standardization evaluation and selection process. The article summarizes each of the 15 candidate algorithms from the third round and identifies the algorithms selected for standardization, as well as those that will continue to be evaluated in the fourth round of analysis. Although the third round is coming to an end and NIST will begin developing the first PQC standards, standardization efforts in this area will continue for some time. This should not be interpreted as meaning that users should wait to adopt post-quantum algorithms. NIST looks forward to the rapid implementation of these first standardized algorithms and will issue future guidance on the transition. The transition will undoubtedly have many complexities, and there will be challenges for some use cases such as IoT devices or certificate transparency.
Cryptography is a term that safeguards the security of electronic banking transactions, and emails, and most importantly our country relies on cryptography for national security purposes. Post Quantum Cryptography (PQC) has a major aim of developing newer cryptographic schemes that make the cryptosystem secure against quantum computers. This is a state-of-the-art research topic, and it is encouraged by some security agencies like the National Security Agency (NSA). This paper presents a concise and up-to-date review of post-quantum cryptographic (PQC) algorithms submitted to the National Institute of Standards and Technology (NIST) for standardization. Highlighting the need for cryptographic resilience in the era of quantum computing, the study focuses on the technical evaluation of candidate algorithms, including their performance in terms of time and space efficiency. It also examines the progression of these algorithms through NIST’s multi-round selection process, highlighting key developments and implementation challenges. The paper aims to provide researchers with a clear overview of the current state of PQC standardization and the practical considerations involved in deploying secure, quantum-resistant cryptographic solutions.
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.
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.