This article describes the main trends in the development of cryptography, in particular, the need for active research in the field of postquantum cryptography. The purpose of the article was to review the latest trends in the field of post-quantum cryptography, due to the emergence of quantum algorithms, in order to reflect the current problems arising in the field of modern cryptography. The main method of research is the analysis of scientific literature for the period from 2016 to 2022. The use of quantum computer and quantum algorithms will significantly reduce the time of cracking keys with encryption and solve some types of cryptographic hash functions, which will lead to a significant increase in the length of keys and a decrease in performance. Due to the great economic influence of the USA, it is necessary to pay attention to the post–quantum NIST contests: from the algorithms under consideration, lattice-based algorithms will be standardized, which are the most reliable and efficient in terms of performance according to NIST, however, in order not to rely only on this type of algorithms, NIST selected alternative algorithms–isogeny–based, code–based, hash–based. So, there is a need to conduct research on the search for post-quantum algorithms of various types, which is confirmed by various NIST competitions. Post-quantum algorithms based on the computational difficulty of solving systems of many quadratic equations with many variables are also effective, such algorithms have not been considered by NIST, but they are relevant for further research. Since updating protocols, schemes and infrastructure objects must be carried out together with the introduction of new cryptographic algorithms, the replacement of currently used cryptographic algorithms can be very destructive and take decades, re-encryption with such a new algorithm of stored information and keys can also be used.
This article describes the main trends in the development of cryptography, in particular, the need for active research in the field of postquantum cryptography. The purpose of the article was to review the latest trends in the field of post-quantum cryptography, due to the emergence of quantum algorithms, in order to reflect the current problems arising in the field of modern cryptography. The main method of research is the analysis of scientific literature for the period from 2016 to 2022. The use of quantum computer and quantum algorithms will significantly reduce the time of cracking keys with encryption and solve some types of cryptographic hash functions, which will lead to a significant increase in the length of keys and a decrease in performance. Due to the great economic influence of the USA, it is necessary to pay attention to the post–quantum NIST contests: from the algorithms under consideration, lattice-based algorithms will be standardized, which are the most reliable and efficient in terms of performance according to NIST, however, in order not to rely only on this type of algorithms, NIST selected alternative algorithms–isogeny–based, code–based, hash–based. So, there is a need to conduct research on the search for post-quantum algorithms of various types, which is confirmed by various NIST competitions. Post-quantum algorithms based on the computational difficulty of solving systems of many quadratic equations with many variables are also effective, such algorithms have not been considered by NIST, but they are relevant for further research. Since updating protocols, schemes and infrastructure objects must be carried out together with the introduction of new cryptographic algorithms, the replacement of currently used cryptographic algorithms can be very destructive and take decades, re-encryption with such a new algorithm of stored information and keys can also be used.
Information security is a fundamental and urgent issue in the digital transformation era. Cryptographic techniques and digital signatures have been applied to protect and authenticate relevant information. However, with the advent of quantum computers and quantum algorithms, classical cryptographic techniques have been in danger of collapsing because quantum computers can solve complex problems in polynomial time. Stemming from that risk, researchers worldwide have stepped up research on post-quantum algorithms to resist attack by quantum computers. In this review paper, we survey studies in recent years on post-quantum cryptography (PQC) and provide statistics on the number and content of publications, including a literature overview, detailed explanations of the most common methods so far, current implementation status, implementation comparisons, and discussion on future work. These studies focused on essential public cryptography techniques and digital signature schemes, and the US National Institute of Standards and Technology (NIST) launched a competition to select the best candidate for the expected standard. Recent studies have practically implemented the public key encryption/key encapsulation mechanism (PKE/KEM) and digital signature schemes on different hardware platforms and applied various optimization measures based on other criteria. Along with the increasing number of scientific publications, the recent trend of PQC research is increasingly evident and is the general trend in the cryptography industry. The movement opens up a promising avenue for researchers in public key cryptography and digital signatures, especially on algorithms selected by NIST.
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.
Virtually all asymmetric cryptographic schemes currently in use are threatened by the potential development of powerful quantum computers. Although there is currently no definite answer and it is very unclear when or even if CRQC will ever be built and the gap between modern quantum computers and the envisioned CRQC is huge, the risk of creating CRQC means that currently deployed public key cryptography must be replaced by quantum-resistant ones alternatives. For example, information encrypted using modern public key cryptography can be recorded by cryptanalysts and then attacked if a QRQC can be created. The potential harm that CRQC could cause is the basis of the motivation to seek countermeasures, even though we have uncertainties about when and if these computers can be built. Deployed systems that use public key cryptography can also take years to update. Post-quantum cryptography is one way to combat quantum computer threats. Its security is based on the complexity of mathematical problems that are currently considered unsolvable efficiently – even with the help of quantum computers. Post-quantum cryptography deals with the development and research of asymmetric cryptosystems, which, according to current knowledge, cannot be broken even by powerful quantum computers. These methods are based on mathematical problems for the solution of which neither efficient classical algorithms nor efficient quantum algorithms are known today. Various approaches to the implementation of post-quantum cryptography are used in modern research, including: code-based cryptography, lattice-based cryptography, hashing-based cryptography, isogeny-based cryptography, and multidimensional cryptography. The purpose of this work is to review the computational model of quantum computers; quantum algorithms, which have the greatest impact on modern cryptography; the risk of creating cryptographically relevant quantum computers (CRQC); security of symmetric cryptography and public key cryptography in the presence of CRQC; NIST PQC standardization efforts; transition to quantum-resistant public-key cryptography; relevance, views and current state of development of quantum-resistant cryptography in the European Union. It also highlights the progress of the most important effort in the field: NIST's standardization of post-quantum cryptography.
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.
Quantum computers threaten to break asymmetric cryptography protocols almost immediately. To address this, researchers are developing post-quantum cryptography (PQC), which offers greater security but comes with higher costs and greater implementation complexity. The objective of this article is to identify the NEW cryptographic schemes, methods, and algorithms designed to resist quantum attacks. To do so, we first conducted a literature review that included mapped studies, systematic reviews, and surveys published in 2025 and mid-2026. This would help identify gaps and knowledge vacuums. Second, we conducted a systematic review using the PRISMA methodological guidelines for the period between 2020 and mid-2026 to compare the performance of PQC schemes, characterize the main challenges of their implementation, and identify trends. The results show that lattice-based schemes, followed by code-based and hash-based schemes, are the most extensively researched because they balance security, computational efficiency, and readiness for standardization. Furthermore, the most commonly reported performance metrics are key and signature sizes, as well as execution times. Meanwhile, scalability, power consumption, and performance on resource-constrained devices have been explored very little. Our study concludes with the key priorities that are likely to shape the future development of PQC.
The threats are existential to the traditional cryptosystems of public keys, including RSA, Diffie-Hellman, and elliptic curve cryptography (ECC), due to the rapid progress in quantum computing. Such algorithms as the Shor and Grover algorithms prove that as soon as large scale quantum computers are achieved, these classical cryptographic protocols will not provide any privacy and integrity to online communication. This has created an emergency to find post-quantum cryptography (PQC), or quantum-safe cryptography, which will resist attacks by both classical and quantum attackers. The paper is a review of the latest research and development in post-quantum cryptographic algorithms and their implementation in current security systems. We organize quantum-safe methods into significant organizations such as lattice-based, hash-based, multivariate polynomial-based and code-based encrypted communications. Each type has been evaluated critically based on computational efficiency, key sizes, speed of encryption/decryption and security proofs. The survey also examines the current standardization activities happening in the world and especially the U.S. National Institute of Standards and Technology (NIST) PQC competition, which lists candidate algorithms that have advanced to standard adoption. Besides this, the paper addresses hybrid cryptographic designs that use both classical and post-quantum bases in ensuring a seamless migration in the transition phase. Internet security protocols like TLS, VPNs and blockchain consensus as applications of PQC are examined in detail. Lastly, we pinpoint open research issues, which include creating lightweight PQC to support resource-constrained IoT devices, balancing performance and strong security assurances, and interoperability between the new PQC algorithms and existing infrastructures. Through detailed survey we inform the future of researchers, practitioners, and policymakers on the preparation of the post-quantum era of secure digital communications.