Federal policy now requires a transition to the NIST post-quantum standards ML-KEM (FIPS 203) and ML-DSA (FIPS 204). This report measures their computation time and message sizes at all standardized parameter sets on Google Colab cloud VM, against classical X25519, ECDSA P-256, and Ed25519. On Google Colab cloud VM, an ML-KEM-768 encapsulation took 28 microseconds and an ML-DSA-65 signature took 172 microseconds. Message size is the larger burden: one ML-KEM-768 exchange sends 2,272 bytes versus 64 for X25519, and an ML-DSA-65 public key plus signature is 5,261 bytes versus 96 for Ed25519. Timing was measured on a general-purpose platform as a reproducible baseline. Key, ciphertext, and signature sizes are identical on every platform, so the size results and their consequences for low-power wireless links apply directly to constrained devices; timing on constrained hardware is the next stage of this work. Code and raw data are available at https://github.com/iqrabatool/pqc-constrained-bench.
Federal policy now requires a transition to the NIST post-quantum standards ML-KEM (FIPS 203) and ML-DSA (FIPS 204). This report measures their computation time and message sizes at all standardized parameter sets on Google Colab cloud VM, against classical X25519, ECDSA P-256, and Ed25519. On Google Colab cloud VM, an ML-KEM-768 encapsulation took 28 microseconds and an ML-DSA-65 signature took 172 microseconds. Message size is the larger burden: one ML-KEM-768 exchange sends 2,272 bytes versus 64 for X25519, and an ML-DSA-65 public key plus signature is 5,261 bytes versus 96 for Ed25519. Timing was measured on a general-purpose platform as a reproducible baseline. Key, ciphertext, and signature sizes are identical on every platform, so the size results and their consequences for low-power wireless links apply directly to constrained devices; timing on constrained hardware is the next stage of this work. Code and raw data are available at https://github.com/iqrabatool/pqc-constrained-bench.
The recent introduction of Google’s Willow quantum chip has demonstrated remarkable computational capabilities, solving problems in microseconds that would take classical computers millions of years. As quantum computers advance toward cryptographic relevance, existing encryption algorithms become vulnerable to attacks that could break them within seconds or minutes, rendering current cryptographic protections ineffective. This necessitates the establishment of post-quantum cryptography (PQC) standards to secure systems in the quantum era. This study evaluates the performance of NIST-standardized PQC algorithms ML-KEM (512, 768, 1024) and ML-DSA (2, 3, 5) on a Raspberry Pi 4 Model B, representing baseline IoT device capabilities. Using the Liboqs library, each algorithm was executed across 1000 iterations in a real-world wireless network environment connected to a router, accounting for practical network conditions such as packet loss, latency, and jitter to assess computational feasibility under resource-constrained conditions. Experimental results demonstrate the practical viability of PQC algorithms in IoT environments. ML-KEM-512 achieves encapsulation in 55.76 μs and decapsulation in 56.15 μs, with key generation in 123.78 μs (median), while ML-DSA-44 completes signature generation in 379.83 μs and verification in 159.38 μs. These findings confirm that both ML-KEM and ML-DSA algorithms offer efficient and rapid performance, making them suitable candidates for securing IoT devices against quantum threats.
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.
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.
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.
Post-Quantum Cryptography (PQC) has emerged as a means to protect encryption from Quantum Computing (QC). Quantum Computing poses a threat towards classical cryptography because of its enhanced capability to solve complex mathematical problems quickly. To combat this, NIST has developed three standards for PQC: FIPS 203, FIPS 204, and FIPS 205. This study compares how the algorithms defined in FIPS 204 and FIPS 205, ML-DSA and SLH-DSA, compare to a baseline classical algorithm, Ed25519. Findings show that both ML-DSA and SLH-DSA offer slower signing times and verifying times compared to Ed25519. The algorithms also consume different amounts memory which can have an impact on future implementations. Future directions include the addition of future algorithms to improve the generability, a closer look at the ecological impacts as well as examining the component bottleneck in order to get a better understanding of how a switch towards these algorithms may impact the future.
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.