The rapid advancement of quantum computing poses a significant threat to classical cryptographic systems, particularly to widely used public-key schemes that rely on integer factorisation and the discrete logarithm problem. To ensure long-term data security against potential quantum adversaries, post-quantum cryptography (PQC) is currently standardised by the National Institute of Standards and Technology (NIST). This paper goes beyond a theoretical overview by employing a systematic methodology to evaluate the empirical performance trade-offs of the newly standardised algorithms (ML-KEM, ML-DSA, and SLH-DSA) and key finalists (FN-DSA and HQC). Based on a comprehensive review of fragmented performance data, the work presents a comparative analysis focusing on data overhead, computational latency, and resource efficiency. As a primary contribution, this study proposes a deployment-oriented taxonomy that explicitly maps these PQC standards to optimal practical use cases, considering diverse constraints across Internet of Things, cloud environments, and blockchain networks. Furthermore, the paper addresses critical real-world deployment challenges, such as vulnerabilities to side-channel attacks and hardware-level implementation constraints. Ultimately, this work systematises current knowledge into a unified decision-making framework, guiding system architects in complex migration towards a quantum-resilient digital ecosystem.
The rapid advancement of quantum computing poses a significant threat to classical cryptographic systems, particularly to widely used public-key schemes that rely on integer factorisation and the discrete logarithm problem. To ensure long-term data security against potential quantum adversaries, post-quantum cryptography (PQC) is currently standardised by the National Institute of Standards and Technology (NIST). This paper goes beyond a theoretical overview by employing a systematic methodology to evaluate the empirical performance trade-offs of the newly standardised algorithms (ML-KEM, ML-DSA, and SLH-DSA) and key finalists (FN-DSA and HQC). Based on a comprehensive review of fragmented performance data, the work presents a comparative analysis focusing on data overhead, computational latency, and resource efficiency. As a primary contribution, this study proposes a deployment-oriented taxonomy that explicitly maps these PQC standards to optimal practical use cases, considering diverse constraints across Internet of Things, cloud environments, and blockchain networks. Furthermore, the paper addresses critical real-world deployment challenges, such as vulnerabilities to side-channel attacks and hardware-level implementation constraints. Ultimately, this work systematises current knowledge into a unified decision-making framework, guiding system architects in complex migration towards a quantum-resilient digital ecosystem.
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 prospect of cryptographically relevant quantum computers threatens public-key primitives underpinning modern digital infrastructure, including RSA, Diffie-Hellman, and elliptic-curve cryptography. Post-quantum cryptography (PQC) responds with algorithms believed to be hard for both classical and quantum adversaries. In August 2024, the U.S. National Institute of Standards and Technology (NIST) finalised the first three PQC standards: FIPS 203 (ML-KEM, based on Kyber), FIPS 204 (ML-DSA, based on Dilithium), and FIPS 205 (SLH-DSA, based on SPHINCS+). This paper surveys the algorithmic families behind these standards, the harvest-now-decrypt-later threat model, hybrid migration strategies, performance trade-offs, and the engineering challenges of transitioning the global cryptographic stack. We examine deployment progress in TLS, SSH, X.509, and constrained devices, and outline open research questions on side-channel security, falcon-style signatures, and the long-term replacement schedule for classical asymmetric cryptography.
The emergence of large-scale quantum computing presents an imminent threat to contemporary public-key cryptosystems, with quantum algorithms such as Shor’s algorithm capable of efficiently breaking RSA and elliptic curve cryptography (ECC). This vulnerability has catalyzed accelerated standardization efforts for post-quantum cryptography (PQC) by the U.S. National Institute of Standards and Technology (NIST) and global security stakeholders. While theoretical security analysis of these quantum-resistant algorithms has advanced considerably, comprehensive real-world performance benchmarks spanning diverse computing environments—from high-performance cloud infrastructure to severely resource-constrained IoT devices—remain insufficient for informed deployment planning. This paper presents the most extensive cross-platform empirical evaluation to date of NIST-selected PQC algorithms, including CRYSTALS-Kyber and NTRU for key encapsulation mechanisms (KEMs), alongside BIKE as a code-based alternative, and CRYSTALS-Dilithium and Falcon for digital signatures. Our systematic benchmarking framework measures computational latency, memory utilization, key sizes, and protocol overhead across multiple security levels (NIST Levels 1, 3, and 5) in three distinct hardware environments and various network conditions. Results demonstrate that contemporary server architectures can implement these algorithms with negligible performance impact (<5% additional latency), making immediate adoption feasible for cloud services. In contrast, resource-constrained devices experience more significant overhead, with computational demands varying by up to 12× between algorithms at equivalent security levels, highlighting the importance of algorithm selection for edge deployments. Beyond standalone algorithm performance, we analyze integration challenges within existing security protocols, revealing that naive implementation of PQC in TLS 1.3 can increase handshake size by up to 7× compared to classical approaches. To address this, we propose and evaluate three optimization strategies that reduce bandwidth requirements by 40–60% without compromising security guarantees. Our investigation further encompasses memory-constrained implementation techniques, side-channel resistance measures, and hybrid classical-quantum approaches for transitional deployments. Based on these comprehensive findings, we present a risk-based migration framework and algorithm selection guidelines tailored to specific use cases, including financial transactions, secure firmware updates, vehicle-to-infrastructure communications, and IoT fleet management. This practical roadmap enables organizations to strategically prioritize systems for quantum-resistant upgrades based on data sensitivity, resource constraints, and technical feasibility. Our results conclusively demonstrate that PQC is deployment-ready for most applications, provided that implementations are carefully optimized for the specific performance characteristics and security requirements of target environments. We also identify several remaining research challenges for the community, including further optimization for ultra-constrained devices, standardization of hybrid schemes, and hardware acceleration opportunities.
The transition to post-quantum cryptography (PQC) marks a pivotal shift in ensuring digital security, prompted by the potential of quantum computers to compromise classical systems such as Rivest-Shamir-Adlema and elliptic-curve cryptography. In response, NIST has standardized three foundational PQC algorithms: Module-lattice-based Key-encapsulation Mechanism for key establishment; Module-lattice-based Digital Signature, and Stateless Hash-based Digital Signature algorithms for digital signatures. Meanwhile, FALCON and Hamming Quasi-cyclic (HQC) schemes, both selected as finalists, are expected to join the standards soon. This paper presents a comprehensive survey of these NIST-selected PQC standards, with a dual focus on software implementations and hardware architecture designs. We analyze their mathematical frameworks, distinctive features, and optimization strategies related to performance, security, and resource efficiency. The software review examines algorithmic complexity, memory usage, and programming considerations, while the hardware review discusses FPGA and ASIC implementations, emphasizing modular arithmetic, polynomial operations, and resource efficiency challenges. A comparative analysis highlights the strengths and trade-offs of each algorithm, offering insights into their applicability across various platforms-from resource-constrained internet of things devices to high-performance computing environments. This study provides a foundational understanding of NIST’s selected PQC standards and their practical deployment in securing the post-quantum era.
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 rapid developments in quantum computing pose a critical threat to classical public-key cryptography, particularly RSA and Elliptic Curve Cryptography (ECC), which rely on mathematical problems solvable by Shor’s algorithm. In response, the National Institute of Standards and Technology (NIST) has standardized quantum-resistant algorithms, including ML-KEM, ML-DSA, FALCON, and SPHINCS+, to prepare global infrastructure for a post-quantum future. This paper provides a unified comparative analysis of classical cryptography and NIST-standardized PQC algorithms, evaluating their security assumptions, efficiency, architectural characteristics, and resilience against quantum adversaries. A comprehensive literature review identifies gaps in existing studies, particularly concerning unified migration frameworks that combine theory, implementation requirements, certificate ecosystem changes, and organizational readiness. To address these gaps, the paper proposes a structured comparative framework and outlines practical migration strategies, including hybrid cryptographic deployment, protocol upgrades, and phased transition roadmaps. The findings highlight that while PQC introduces larger key and signature sizes, its quantum resistance and standardization maturity make it essential for long-term security. The study concludes that strategic migration planning, driven by hybrid adoption and ecosystem adjustments, is crucial for ensuring a secure and seamless transition to post-quantum cryptography