Abstract The prospect of cryptanalytically relevant quantum computers (CRQCs) motivates a transition from classical cryptography to post-quantum cryptography (PQC). Shor’s algorithm threatens widely deployed public-key schemes used for key establishment and digital signatures, while Grover’s algorithm reduces effective security margins for symmetric-key and hash-based primitives. The harvest-now, decrypt-later (HNDL) threat further increases urgency because adversaries can store encrypted data today for future decryption, placing long-lived confidentiality requirements and trust infrastructure at risk. This survey frames PQC adoption as a standards-to-deployment program. We review the PQC design space and summarize deployment-critical constraints, including handshake and certificate size growth, latency under network loss, computational cost, memory and storage requirements, implementation complexity, and side-channel robustness. We then present an iterative migration pipeline covering cryptographic inventory, risk-based prioritization using data sensitivity and cryptoperiod, algorithm and parameter profile selection, hybrid classical and PQC constructions for backward compatibility, pilot validation with measurable go/no-go criteria, and long-term operations with crypto-agility. Finally, we connect standardization outputs to concrete integration surfaces and illustrate the workflow across transport layer security (TLS) and the web public key infrastructure (Web PKI), virtual private networks (VPNs) and internet protocol security (IPsec), and constrained Internet of things (IoT) deployments, and we summarize open challenges in interoperability, public key infrastructure (PKI) transition mechanics, implementation maturity and operational governance.
Abstract The prospect of cryptanalytically relevant quantum computers (CRQCs) motivates a transition from classical cryptography to post-quantum cryptography (PQC). Shor’s algorithm threatens widely deployed public-key schemes used for key establishment and digital signatures, while Grover’s algorithm reduces effective security margins for symmetric-key and hash-based primitives. The harvest-now, decrypt-later (HNDL) threat further increases urgency because adversaries can store encrypted data today for future decryption, placing long-lived confidentiality requirements and trust infrastructure at risk. This survey frames PQC adoption as a standards-to-deployment program. We review the PQC design space and summarize deployment-critical constraints, including handshake and certificate size growth, latency under network loss, computational cost, memory and storage requirements, implementation complexity, and side-channel robustness. We then present an iterative migration pipeline covering cryptographic inventory, risk-based prioritization using data sensitivity and cryptoperiod, algorithm and parameter profile selection, hybrid classical and PQC constructions for backward compatibility, pilot validation with measurable go/no-go criteria, and long-term operations with crypto-agility. Finally, we connect standardization outputs to concrete integration surfaces and illustrate the workflow across transport layer security (TLS) and the web public key infrastructure (Web PKI), virtual private networks (VPNs) and internet protocol security (IPsec), and constrained Internet of things (IoT) deployments, and we summarize open challenges in interoperability, public key infrastructure (PKI) transition mechanics, implementation maturity and operational governance.
Abstract—The advent of fault-tolerant Cryptanalytically Relevant Quantum Computers (CRQCs) presents an existential threat to modern information security. Shor's polynomial-time quantum algorithm renders widely deployed public-key cryptographic primitives—including RSA, Diffie-Hellman (DH), and Elliptic Curve Cryptography (ECDH/ECDSA)—completely vulnerable to private key derivation. Furthermore, 'Harvest Now, Decrypt Later' (HNDL) adversarial campaigns actively intercept and store encrypted enterprise telemetry today, anticipating future quantum decryption capabilities. In response, the National Institute of Standards and Technology (NIST) finalized its primary Post-Quantum Cryptography (PQC) standards in FIPS 203 (ML-KEM), FIPS 204 (ML-DSA), and FIPS 205 (SLH-DSA). However, transitioning complex enterprise IT ecosystems to quantum-resistant primitives introduces severe architectural and computational disruptions: public key and signature sizes increase by several orders of magnitude, cryptographic handshake latencies escalate, network packets experience Maximum Transmission Unit (MTU) fragmentation, and legacy Hardware Security Modules (HSMs) lack microarchitectural support for lattice-based polynomial arithmetic. This paper provides an exhaustive, mathematically grounded technical survey and architectural roadmap for enterprise PQC migration. We formalize the Module Learning with Errors (M-LWE) and Module Short Integer Solution (M-SIS) hardness foundations, evaluate hybrid classical/post-quantum cryptographic transition models across standard transport protocols (TLS 1.3, IKEv2/IPsec, SSH), and formulate an enterprise Crypto-Agility Maturity Model. Furthermore, we construct an empirical enterprise testbed measuring throughput, connection establishment latency, memory footprints, and packet fragmentation across legacy and quantum-resistant suites. Our results show that while ML-KEM-768 achieves microsecond-level encapsulation, its 1,088-byte ciphertext expands TLS ClientHello payloads into multiple TCP segments under constrained networks. Finally, we establish open research directions in post-quantum identity federations, stateful hash signature tracking, and hardware-accelerated polynomial arithmetic. Index Terms—Post-Quantum Cryptography (PQC), FIPS 203 (ML-KEM), FIPS 204 (ML-DSA), Crypto-Agility, TLS 1.3, Lattice-Based Cryptography, Harvest Now Decrypt Later, Hardware Security Modules (HSM), Enterprise Migration.
As the era of quantum computing approaches, the fundamental cryptographic primitives securing global communications face a paradigm shift. With the National Institute of Standards and Technology (NIST) finalizing new standards, the industry must urgently address the vulnerabilities of legacy systems. The imminent advent of CRQCs (Cryptographically Relevant Quantum Computers) poses an existential threat to the Public Key Infrastructure (PKI) underpinning the global digital economy. Classical algorithms such as RSA and ECC (Elliptic Curve Cryptography) are vulnerable to polynomial-time cryptanalysis via Shor’s algorithm. This study investigates the HNDL (Harvest Now, Decrypt Later) threat model and evaluates the resilience of NIST-standardized PQC (Post-Quantum Cryptography) algorithms: ML-KEM and ML-DSA. Utilizing a high-performance Fortinet networking environment, we experimentally validate that "Hybrid Mode" IPsec VPNs can achieve quantum resistance with negligible performance degradation, offering a viable migration path for enterprise infrastructure. Specifically, we benchmark the trade-offs between PQC’s larger key sizes and network latency, demonstrating that the overhead remains within acceptable operational thresholds. Implementing hybrid protocols provides a critical transition mechanism, allowing organizations to secure long-term data confidentiality against retrospective decryption while preserving interoperability with legacy systems.
The prospect of a cryptographically relevant quantum computer (CRQC) undermines the public-key primitives that secure virtually every layer of modern communication networks, from subscriber authentication in cellular cores to transport-layer key exchange. Adversaries already following a harvest-now, decrypt-later (HNDL) strategy make this threat actionable today for any traffic whose confidentiality must outlast a decade. Following NIST’s finalisation of the first post-quantum cryptography (PQC) standards, ML-KEM (FIPS 203), ML-DSA (FIPS 204), and SLH-DSA (FIPS 205) in August 2024, and the selection of HQC as a fourth key-encapsulation candidate in March 2025, research has shifted from algorithm design to network-level integration. This paper reports a PRISMA-2020-compliant systematic literature review of PQC migration in communication networks, structured around five research questions covering protocol and scenario coverage, quantitative performance impact, hybrid cryptography strategies, transition barriers, and open research gaps. Six databases (IEEE Xplore, Scopus, Web of Science, ACM Digital Library, SpringerLink, and MDPI) were searched (3229 records identified); after deduplication, title-keyword screening, full-text eligibility assessment, and a pre-specified quality appraisal (Q1–Q6, threshold ≥3/6) applied to 310 eligible studies, a final synthesis corpus of 141 studies (68 journal articles, 68 conference papers, 4 conference-derived book chapters, 1 workshop paper) was screened, quality-appraised, and synthesised narratively with supporting evidence tables. The review finds that transport-layer protocols (TLS 1.3, QUIC, DTLS 1.3) dominate the literature, that lattice-based ML-KEM/ML-DSA offer the most favourable latency–bandwidth–energy trade-off among standardised families, and that classical–PQC hybrid schemes are the de facto transition strategy across 5G/6G, IoT, VPN, and automotive scenarios, at the cost of 10–100× larger keys/signatures and 8–40% handshake latency overhead. Persistent barriers include constrained-device resource limits, immature hardware acceleration, incomplete IETF/3GPP standardisation, and public-key-infrastructure scaling. We propose a five-level PQC transition-readiness maturity model and identify large-scale field validation, PQC–QKD integration, and lightweight signature schemes as priority directions for future work.
This paper provides a comprehensive review of quantum readiness as a critical, multidimensional framework for navigating the upcoming quantum computing era. It addresses the imminent threat posed by cryptographically relevant quantum computers (CRQCs), which will be capable of breaking the public-key cryptographic systems (like RSA and ECC) that currently secure digital communications and e-commerce. The concept of ”harvest now, decrypt later” (HNDL), where adversaries collect encrypted data today to decrypt it once quantum computers are available, highlights the urgency of this transition. The review is structured around three key dimensions: the theoretical foundations of post-quantum cryptography (PQC), global standardization efforts, and real-world sectoral implementations. It discusses how quantum algorithms, specifically Shor’s and Grover’s algorithms, can render classical cryptography obsolete, and it analyzes the NIST Post-Quantum Cryptography Standardization Project, which has selected the first-generation PQC standards. The paper also examines strategies from the European Union and other nations, noting the geopolitical implications of standards fragmentation. Furthermore, the review explores the practical adoption of PQC in critical sectors like finance, telecommunications, and defense, emphasizing the importance of crypto-agility—the ability to rapidly switch cryptographic algorithms—for future-proofing systems. It also highlights open challenges, including performance overheads, legacy system migration, and the shortage of skilled professionals. The paper concludes by outlining future directions for a secure transition, advocating for continuous research, global collaboration, and sustained investment to build a quantum-resilient digital ecosystem.
As quantum computing advances, classical public-key cryptosystems face escalating risks, driving global standardization efforts by NIST, ETSI, and ISO. This paper provides a comprehensive review of recent developments in post-quantum cryptography (PQC), focusing on lattice-based, hash-based, and multivariate approaches. We examine their security foundations, implementation challenges, and applicability across domains such as finance, blockchain, and the Internet of Things (IoT). A core contribution is the proposed Hybrid Cryptographic Framework (HCF), which combines classical and quantum-resistant primitives to enable a secure and interoperable migration path. The framework integrates hybrid key exchange, dual-signature schemes, and PQC-compatible Merkle trees, and is supported by a discrete multi-objective optimization model for selecting algorithms under real-world constraints. The paper also discusses deployment challenges, including hardware acceleration, side-channel resistance, and legacy compatibility. Real-world case studies illustrate how leading institutions are piloting PQC integration in practice. Finally, we propose a strategic roadmap for PQC adoption, incorporating adaptive triggers based on quantum capabilities and evolving threat models. By aligning cryptographic design with international standards and practical system requirements, this work offers guidance for building resilient, quantum-safe infrastructures.
Quantum computing offers major computational advances but threatens modern public-key cryptography. Classical algorithms such as RSA, Diffie–Hellman (DH), and Elliptic Curve Cryptography (ECC) are vulnerable to quantum attacks, particularly Shor’s algorithm. As large-scale quantum capabilities emerge, post-quantum cryptography (PQC) has become essential to ensure future data confidentiality, integrity, and authentication. This paper discusses the need to replace classical cryptography, explores quantum-safe solutions, and examines challenges in large-scale migration. PQC is critical across government, critical infrastructure, finance, healthcare, telecommunications, IoT, autonomous vehicles, and 6G networks. A key concern is “harvest-now, decrypt-later” attacks, where encrypted data is stored today for future quantum decryption. The study analyzes classical cryptographic vulnerabilities and reviews major PQC families: lattice-based, hash-based, code-based, multivariate-based, and isogeny-based schemes, highlighting the ongoing NIST standardization efforts. It proposes a migration framework including quantum-readiness assessment, algorithm selection, hybrid implementation, and performance evaluation. Results show that although PQC introduces higher computational complexity, optimized implementations can support real-time applications with reasonable overhead. Among PQC approaches, lattice-based schemes appear most mature and balanced in terms of security and key size. The paper concludes that quantum-safe cryptography is a necessary evolution requiring continuous monitoring, adaptable systems, and alignment with emerging standards.