The advent of large-scale, fault-tolerant quantum computers threatens the mathematical foundations - namely integer factorization and discrete-logarithm hardness - on which today's public-key cryptography relies could be rendered insecure. This has shifted the need to move to Post-Quantum Cryptography (PQC) from a theoretical to an engineering priority. This work presents an extensive empirical comparison of the NIST standardized primitives used for key encapsulation (FIPS 203: ML-KEM) and digital signatures (FIPS 204: ML-DSA) with the standardised classical RSA-3072 primitives at similar security levels as defined by the NIST security level. This paper evaluates three fundamental performance metrics: (i) computational latency in CPU clock cycles; (ii) communication cost in bytes; and (iii) memory usage during the cryptographic operation, and combines them into a unified evaluation framework. Additionally, the paper discusses the mathematical principles of the standardized quantum-resistant schemes, namely Module Short Integer Solution (MSIS) and Module Learning With Errors (MLWE) focusing on their security principles. Benchmarking reveals that, despite lattice-based schemes incurring larger public key and signature sizes-up to$32 \times$relative to elliptic-curve counterpartsML-KEM-768 decapsulation is approximately$108 \times$faster than an RSA-3072 private-key operation, and ML-DSA-65 signing is approximately 19× faster than RSA-3072 signing. To support cryptographic agility during the post-quantum migration period, this paper proposes a modular hybrid architecture validated through a triple-hybrid (ECDH + Kyber + BB84 QKD) demonstration.
The advent of large-scale, fault-tolerant quantum computers threatens the mathematical foundations - namely integer factorization and discrete-logarithm hardness - on which today's public-key cryptography relies could be rendered insecure. This has shifted the need to move to Post-Quantum Cryptography (PQC) from a theoretical to an engineering priority. This work presents an extensive empirical comparison of the NIST standardized primitives used for key encapsulation (FIPS 203: ML-KEM) and digital signatures (FIPS 204: ML-DSA) with the standardised classical RSA-3072 primitives at similar security levels as defined by the NIST security level. This paper evaluates three fundamental performance metrics: (i) computational latency in CPU clock cycles; (ii) communication cost in bytes; and (iii) memory usage during the cryptographic operation, and combines them into a unified evaluation framework. Additionally, the paper discusses the mathematical principles of the standardized quantum-resistant schemes, namely Module Short Integer Solution (MSIS) and Module Learning With Errors (MLWE) focusing on their security principles. Benchmarking reveals that, despite lattice-based schemes incurring larger public key and signature sizes-up to32×relative to elliptic-curve counterpartsML-KEM-768 decapsulation is approximately108×faster than an RSA-3072 private-key operation, and ML-DSA-65 signing is approximately 19× faster than RSA-3072 signing. To support cryptographic agility during the post-quantum migration period, this paper proposes a modular hybrid architecture validated through a triple-hybrid (ECDH + Kyber + BB84 QKD) demonstration.
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 quantum computing poses an existential threat to classical cryptographic systems that form the backbone of contemporary digital security infrastructure. RSA, the most widely deployed public-key cryptosystem, relies on the computational hardness of integer factorization, a problem efficiently solvable by quantum computers using Shor's algorithm. This impending vulnerability has catalyzed the development of post-quantum cryptographic alternatives designed to withstand both classical and quantum attacks. CRYSTALS-Kyber, standardized by NIST as ML-KEM, represents the forefront of latticebased key encapsulation mechanisms, offering quantum resistance through the Module Learning With Errors (MLWE) problem. This paper presents a comprehensive comparative analysis of RSA and Kyber, examining their mathematical foundations, security architectures, operational characteristics, and performance metrics across diverse computational environments. The study investigates the fundamental trade-offs between legacy systems optimized for classical threat models and emerging quantum-resistant algorithms designed for future-proof security. Through detailed analysis of key generation, encryption/encapsulation, decryption/decapsulation operations, and security guarantees, this research establishes the technical rationale behind NIST's selection of Kyber as the primary post-quantum key establishment mechanism. The findings demonstrate that while RSA maintains advantages in key size efficiency, Kyber's superior performance profile, quantum resilience, and robust security foundation position it as the essential successor for securing digital communications in the quantum era. This comprehensive study provides critical insights for organizations transitioning from classical to post-quantum cryptographic infrastructure
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.
Background: In August 2024, the U.S. National Institute of Standards and Technology (NIST) finalized the first three post-quantum cryptography (PQC) standards — FIPS 203 (ML-KEM), FIPS 204 (ML-DSA), and FIPS 205 (SLH-DSA) — and, in November 2024, published the initial public draft of NIST IR 8547, which schedules the deprecation of classical public-key cryptography by 2030 and its disallowance after 2035. Organizations therefore face, for the first time, a regulator-defined deadline for a global cryptographic transition. Objective: This paper characterizes the state of PQC deployment as of the end of 2024 and develops a structured, reusable migration framework that converts the new standards into an actionable organizational process. Methods: We apply a design-science methodology combining (i) documentary analysis of the 2024 standards and transition guidance, (ii) a structured synthesis of publicly documented, at-scale PQC deployments in transport, messaging, and shell protocols during 2022–2024, (iii) characterization of wire-size and throughput overheads using published benchmark data, and (iv) construction and cross-validation of a five-phase Crypto-Agility Migration Process (CAMP) against NIST transition guidance and NCCoE migration practices. Results: Deployment evidence shows that hybrid key establishment (X25519 + ML-KEM-768) is already operational at Internet scale, adding approximately 1.2 KB to the TLS 1.3 handshake with negligible latency impact, whereas post-quantum signatures remain the dominant constraint (ML-DSA-65 signatures are 3309 bytes versus 256 bytes for RSA-2048). We identify four systemic migration bottlenecks — FIPS validation lead times, embedded device lifecycles, PKI signature-size pressure, and organizational cryptographic invisibility — and operationalize CAMP to address them, anchoring prioritization in Mosca's inequality and the 2030/2035 deadlines of NIST IR 8547. Conclusions: The 2024 finalization of the PQC standards transforms post-quantum readiness from a research question into an engineering and governance problem. Organizations that establish cryptographic inventory, hybrid piloting, and crypto-agile library interfaces during 2025 will be positioned to meet the 2030 deprecation horizon; organizations that do not will face compressed, higher-risk migrations later in the decade.
Background: The imminent threat posed by cryptographically relevant quantum computers to classical public-key infrastructure specifically RSA and Elliptic-Curve Cryptography (ECC), whose security rests on the conjectured computational intractability of integer factorisation and the discrete logarithm problem respectively has propelled lattice-based cryptography to the centre of global post-quantum standardisation efforts. On 13 August 2024, the United States National Institute of Standards and Technology (NIST) published three landmark Federal Information Processing Standards (FIPS): FIPS 203 (ML-KEM, derived from CRYSTALS-Kyber), FIPS 204 (ML-DSA, derived from CRYSTALS-Dilithium), and FIPS 205 (SLH-DSA, derived from SPHINCS+), with FIPS 206 (FN-DSA, derived from FALCON) in advanced draft. The first three of these standards rest on algebraic structures intimately connected to classical number theory: polynomial rings over integer quotients, cyclotomic fields, and the algebraic geometry of ideal lattices in rings of integers of number fields. Objectives: This article provides: (1) a rigorous mathematical exposition of the lattice problems underpinning NIST’s post-quantum standards, specifically the Learning With Errors (LWE), Ring-LWE (RLWE), Module-LWE (MLWE), Short Integer Solution (SIS), and NTRU problems, and their connections to algebraic number theory; (2) a comparative performance analysis of NIST-standardised lattice-based algorithms against classical RSA and ECC benchmarks; (3) a security analysis examining known classical and quantum attacks on each hard problem; (4) a comparative evaluation of the four NIST-selected algorithms across key size, signature size, and computational benchmarks; and (5) a strategic assessment of the migration challenges facing deployed cryptographic infrastructure. Methods: The study synthesises peer-reviewed literature, NIST official standards documentation (FIPS 203, 204, 205, and draft FIPS 206), and independently published performance benchmarks published between June 2024 and June 2026. Mathematical security analysis is grounded in the worst-case to average-case reductions established by Regev (2005) for LWE and by Lyubashevsky, Peikert, and Regev (2013) [11, 18] for Ring-LWE. Performance data are drawn from Garani (2024) [8], the ARM Cortex-M0+ benchmarking study of Ratnayaka and Fischer (2026) [4], and the cross-platform evaluation by Alzahrani et al. (2025) [2]. Results: NIST’s three August 2024 standards establish a comprehensive lattice-based post-quantum portfolio. ML-KEM-768 produces a 1,184-byte public key and 1,088-byte ciphertext, achieving IND-CCA2 security under the MLWE assumption at NIST Level 3 (AES-192 equivalent). ML-DSA-65 produces 1,952-byte public keys and 3,309-byte signatures under the Module-LWE and Module-SIS assumptions at Level 3. FN-DSA-512 (FALCON, draft FIPS 206) produces 897-byte public keys and 666-byte signatures under the NTRU assumption, offering the most compact lattice-based signatures. Performance benchmarks on an Intel Core i7-12700K (3.6 GHz) confirm that ML-KEM key generation is orders of magnitude faster than RSA-3072 key generation. The algebraic structure of cyclotomic polynomial rings ∑₂ⁿ = Z[x]/(x^n + 1) is central to the efficiency of all three lattice-based NIST standards. Conclusion: Lattice-based cryptography, grounded in the algebraic number theory of ideal lattices over cyclotomic fields, provides the most comprehensive and mathematically well-founded response to the quantum computational threat. The August 2024 NIST standardisation of ML-KEM, ML-DSA, and SLH-DSA represents a landmark in cryptographic history, and the imminent finalisation of FN-DSA will complete the post-quantum toolbox. Organisations should prioritise immediate migration planning, leveraging hybrid classical-quantum schemes during transition, with full transition to NIST post-quantum standards recommended by 2030 per NSA and CISA guidance.
The emergence of fault-tolerant quantum computing poses an existential threat to classical public-key cryptographic systems, including RSA and Elliptic Curve Cryptography (ECC), through Shor's polynomial-time factorization algorithm. The Harvest Now, Decrypt Later (HNDL) attack paradigm further amplifies this threat by enabling adversaries to archive ciphertext today for future quantum-enabled decryption, rendering long-term data confidentiality immediately at risk. While the National Institute of Standards and Technology (NIST) finalized post-quantum cryptographic standards ML-KEM (FIPS 203) and ML-DSA (FIPS 204) in August 2024, their practical integration into complete application-level communication systems remains a largely unaddressed research gap. This paper presents QuantumShield, a hybrid post-quantum secure peer-to-peer communication platform that integrates ML-KEM-768 for quantum-safe key encapsulation, ML-DSA-65 for authenticated digital signatures, and AES-256-GCM for high-throughput symmetric encryption. Our primary research contribution is a rigorous empirical analysis of PQC integration overhead in a real-world communication pipeline, quantifying latency, key size, and security trade-offs against classical RSA-2048 and ECC-256 baselines under controlled experimental conditions. Experimental evaluation across 1,000 iterations demonstrates that ML-KEM-768 encapsulation completes in 2.8 ± 0.2 ms compared to 4.1 ± 0.3 ms for ECDH key agreement — a 32% latency reduction while providing NIST Level 3 post-quantum security. The complete secure transfer pipeline processes 1 MB files in under 22 ms on commodity hardware. The system further provides interactive cryptographic visualization, adversary threat modeling, tamper detection simulation, and a hybrid migration framework demonstrating practical transition from classical to post-quantum infrastructure. QuantumShield establishes that quantum-safe communication is not merely theoretical but deployable today with negligible performance compromise.