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.
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 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.
The advance of quantum computing poses significant risks to traditional cryptographic systems, including RSA and ECC, due to algorithms such as Shor's, prompting an urgent need for robust post-quantum cryptography (PQC) solutions. This paper presents a systematic review of PQC algorithms, encompassing lattice-based, code-based, multivariate polynomial, hash-based, and supersingular isogeny-based cryptography. By evaluating recent publications and NIST standardization efforts, we assess these approaches in terms of quantum resistance, computational efficiency, scalability, and implementation challenges. Lattice-based schemes, notably CRYSTALS-Kyber, excel in quantum-secure encryption and performance, whereas codebased systems like McEliece are hindered by large key sizes. Hash-based signatures, such as SPHINCS+, and isogeny-based protocols, including SIDH, provide promising alternatives but require further optimization to reduce computational overhead. Our analysis highlights the potential of hybrid PQC methods and lightweight hardware implementations for securing emerging domains like IoT, blockchain, and financial systems. The review serves as a foundational resource for researchers and practitioners, advocating the adoption of quantum-resistant cryptography to preserve data confidentiality, integrity, and authenticity in the quantum era.
With the rapid advancement regarding quantum computing, traditional cryptographic systems face an existential threat because of their reliance concerning mathematical challenges which may be addressed effectively solved using quantum algorithms like the one developed by Shor. This imminent risk has driven extensive research into quantum-resistant cryptography (PQC), that seeks to develop encryption methods resilient against attacks powered by quantum computing. This study offers a thorough literature survey on high-level security techniques in quantum security for PQC, analysing past and current research efforts in this domain. We first examine the vulnerabilities of classical cryptographic protocols, including public-key encryption methods such as RSA (developed by Rivest, Shamir, and Adleman) and ECC (which uses elliptic curve mathematics), and traditional cryptographic hashing methods, against quantum adversaries. The study then explores the foundational approaches to quantum-secure cryptography, including lattice-based, hash-based, multivariate polynomial, code-based, and isogeny-based encryption methods that possess emerged as promising candidates for standardization. The survey highlights key challenges in the real-world application of PQC, including performance trade-offs, key size overhead, and deployment complexities. We conclude by identifying future research directions during the creation of scalable, efficient, and provably secure cryptographic methods designed to withstand quantum attacks techniques. As the shift toward the quantum-resilient era approaches, this survey aims to provide a clear and structured comprehension of the evolving the domain of quantum security for PQC.
Post-Quantum Cryptography (PQC) is an emerging field that aims to develop cryptographic algorithms resistant to attacks by quantum computers. As quantum computing technology advances, traditional cryptographic methods such as RSA and ECC are becoming increasingly vulnerable. This systematic review provides an in-depth analysis of the current state of PQC, focusing on the most promising algorithms and their potential applications. The review covers lattice-based, code-based, multivariate, and hash-based cryptographic schemes, evaluating their security, efficiency, and practicality. We also discuss the challenges and future directions in PQC, including standardization efforts and integration into existing cryptographic systems. This paper aims to serve as a comprehensive resource for researchers, practitioners, and policymakers interested in the next generation of cybersecurity algorithms
The looming threat of quantum attacks on the digital infrastructure protected by conventional cryptographic protocol has generated urgency in identifying and deploying countermeasures that can mitigate the threat. There is a need for stronger cryptographic schemes that combine the strengths of both classic and quantum technologies. Post-Quantum Cryptography (PQC) has emerged as a potential solution that can withstand the challenges posed by advances in quantum computing. Owing to the increasing importance of PQC, the present research is an attempt to assess the existing research done so far so that the existing gaps can be identified which can then strengthen the existing literature. The systematic literature review presented in this work has outlined six key categories of PQC, namely, lattice-based, code-based, hash-based, multivariate, isogeny-based, symmetric-key-based cryptosystems. The study concluded that the advances made in quantum computing will result in the development of quantum computers with superior computational power. Such highly efficient quantum computers will have the ability to break the currently available cryptography schemes most used in a variety of practical applications. With the advent of quantum computing, the computational capabilities of the potential cyber attackers would grow exponentially, which would render the traditional cyber security measures inadequate. This calls for techniques like PQC to be developed and strengthen.
With the constantly changing world of computers nowadays, the introduction of quantum computing has posed immense threats to the security of old and previous encryption algorithms. Post-Quantum Cryptography or PQC refers to a new generation of algorithms specifically created to resist the intense quantum computer attacks and offer secure and long-lasting protection to digital communications. As the potential of quantum technology becomes increasingly evident, the pursuit of secure, future-proof cryptographic solutions has never been more critical. This systematic review explores different PQC solutions for their strengths, weaknesses, and challenges of implementation. provides a comprehensive analysis of key studies on quantum-resistant algorithms, migration strategies and examines cryptographic security measures to present a complete picture of the latest advancements in quantum-safe cryptography. In this systematic paper, different PQC algorithms such as lattice, hash, code, multivariate and isogeny are reviewed along with their advantages and disadvantages. It also discusses how such findings will affect the security of real world communication, digital signatures, as well as blockchain security. This ensures how important it is to establish standardized PQC protocols for overall data security. This paper concludes with what future research directions and practical considerations relate to the adoption of PQC in critical infrastructures.