Network defense platforms rely on authenticated management channels between sensors, agents, and controllers. These channels are typically secured with TLS using RSA or elliptic-curve public-key primitives that a cryptanalytically relevant quantum computer executing Shor's algorithm will break. The National Security Agency's Commercial National Security Algorithm Suite 2.0 mandates a transition to quantum-resistant cryptography for national security systems between 2030 and 2035, with hybrid classical-and-post-quantum constructions explicitly permitted during the transition. We present a hybrid attestation protocol for network management channels that combines Ed448 with ML-DSA-87 for mutual authentication and X448 with ML-KEM-1024 for session key establishment. An adversary must forge both a classical elliptic-curve signature and a lattice-based signature to impersonate a peer, and must recover both a classical elliptic-curve shared secret and a lattice-based encapsulated secret to decrypt session traffic. Authentication succeeds only when both signature verifications pass; session keys are derived from the concatenation of both shared secrets through HKDF-SHA-512. The protocol supports both trust-on-first-use key management and a PKI-backed enrollment mode under which peer public keys are authenticated by certificate chains from two parallel certificate authorities (Ed448 and ML-DSA-87). Deployments can select either mode, or a hybrid admitting both paths, allowing the protocol to fit air-gapped environments as well as deployments that require cryptographic rather than observational trust establishment. A cryptographic agility mechanism supports algorithm suite negotiation and hot-swap without device re-provisioning. We specify the protocol, analyze its security against classical and quantum adversaries, and report measured performance from a reference implementation in Python: the full handshake including mutual HELLO, hybrid key exchange, and session key derivation completes in approximately 330 milliseconds on commodity hardware using pure-Python post-quantum primitives. The protocol is one component of a larger network defense platform; a full system description appears in a companion paper.
Network defense platforms rely on authenticated management channels between sensors, agents, and controllers. These channels are typically secured with TLS using RSA or elliptic-curve public-key primitives that a cryptanalytically relevant quantum computer executing Shor's algorithm will break. The National Security Agency's Commercial National Security Algorithm Suite 2.0 mandates a transition to quantum-resistant cryptography for national security systems between 2030 and 2035, with hybrid classical-and-post-quantum constructions explicitly permitted during the transition. We present a hybrid attestation protocol for network management channels that combines Ed448 with ML-DSA-87 for mutual authentication and X448 with ML-KEM-1024 for session key establishment. An adversary must forge both a classical elliptic-curve signature and a lattice-based signature to impersonate a peer, and must recover both a classical elliptic-curve shared secret and a lattice-based encapsulated secret to decrypt session traffic. Authentication succeeds only when both signature verifications pass; session keys are derived from the concatenation of both shared secrets through HKDF-SHA-512. The protocol supports both trust-on-first-use key management and a PKI-backed enrollment mode under which peer public keys are authenticated by certificate chains from two parallel certificate authorities (Ed448 and ML-DSA-87). Deployments can select either mode, or a hybrid admitting both paths, allowing the protocol to fit air-gapped environments as well as deployments that require cryptographic rather than observational trust establishment. A cryptographic agility mechanism supports algorithm suite negotiation and hot-swap without device re-provisioning. We specify the protocol, analyze its security against classical and quantum adversaries, and report measured performance from a reference implementation in Python: the full handshake including mutual HELLO, hybrid key exchange, and session key derivation completes in approximately 330 milliseconds on commodity hardware using pure-Python post-quantum primitives. The protocol is one component of a larger network defense platform; a full system description appears in a companion paper.
The imminent maturity of large-scale quantum computing threatens the confidentiality and authenticity guarantees of the public-key primitives-RSA and elliptic-curve cryptography that currently secure next-generation communication networks, including 5G/6G core and radio-access segments, software-defined edge infrastructures, and massive Internet-of-Things (IoT) deployments. “Harvest-now, decrypt-later” adversaries put long-lived network traffic at risk much before cryptographically relevant quantum machines come into existence. This paper presents QR-SecNet, a Quantum-Resistant Security Framework that combines a lattice-based key-encapsulation mechanism (ML-KEM), a stateless hash-based signature scheme (SLH-DSA) and a classical elliptic-curve exchange within a single hybrid handshake so that the security of a session depends on the hardness of at least one of two mathematically unrelated problems. The framework also includes a crypto-agility controller, which is able to negotiate cipher suites based on device capabilities and network conditions, mitigates downgrade attacks, and supports incremental migration, maintaining interoperability with legacy endpoints. QR-SecNet was evaluated on an emulated 5G/6G network testbed against five representative baselines-RSA-3072, ECDHE-P256, a standalone ML-KEM exchange, a standalone ML-DSA signature scheme, and Classic McEliece using latency, throughput, computational cost, and estimated post-quantum security margin as metrics. Results show that QR-SecNet completes a hybrid handshake in 11.8 ms on average, sustains a throughput of 1,740 connections per second, and preserves at least 128 bits of classical and 192 bits of post-quantum security margin, outperforming standalone post-quantum baselines in latency by 17-46% while remaining within 2.1 ms of the fastest single-primitive scheme.
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.
This study reviews post-quantum cryptographic algorithms for secure communication, focusing on standardized lattice-based schemes and their practical deployment implications. Classical public-key systems such as RSA and elliptic curve cryptography remain central to secure communication, but their long-term security is threatened by quantum algorithms capable of solving factorization and discrete logarithm problems. The study adopts a hybrid approach combining literature-based review with dataset-driven performance analysis. The empirical evaluation compares ML-KEM and ML-DSA with RSA-4096 and ECDSA-P256 using CPU benchmarking and network simulation metrics. Results indicate that ML-KEM provides substantial computational advantages over RSA-4096, making it suitable for latency-sensitive key establishment. ML-DSA also demonstrates competitive performance, especially in verification, but introduces larger signature sizes than ECDSA-P256. The analysis shows that the main deployment challenge is not computational feasibility but increased communication overhead caused by larger keys, ciphertexts, and signatures. These findings suggest that post-quantum migration requires more than direct algorithm replacement. Effective deployment should involve protocol optimization, crypto-agility, hybrid transition strategies, and context-specific parameter selection. Although the dataset focuses mainly on lattice-based algorithms, the study confirms the practical relevance of standardized post-quantum schemes for future secure communication infrastructure and identifies directions for broader evaluation across additional PQC families, including code-based, hash-based, multivariate approaches, real-world networks, and implementation-level security testing in practice contexts.
The transition to post-quantum cryptography presents enterprises with a complex systems-engineering challenge extending beyond algorithm replacement. Transport Layer Security, public key infrastructure, virtual private networks, cloud-native platforms, identity services, and machine-to-machine communications depend on interconnected cryptographic libraries, certificates, protocols, hardware modules, policies, and vendor products. This review examines crypto-agile migration to hybrid post-quantum cryptography, where classical and quantum-resistant mechanisms are combined to preserve established assurance while emerging algorithms and implementations mature. It develops a migration-oriented taxonomy covering cryptographic discovery, dependency mapping, hybrid key establishment, composite authentication, certificate lifecycle management, protocol negotiation, performance optimization, interoperability testing, and operational governance. Particular attention is given to larger keys, ciphertexts, and signatures; handshake fragmentation; certificate-chain expansion; hardware acceleration; legacy compatibility; downgrade resistance; and observability across distributed environments. The review compares migration requirements in enterprise TLS, PKI, remote-access and site-to-site VPNs, service meshes, API gateways, container platforms, serverless services, secrets systems, and multicloud infrastructures. It also analyzes staged deployment patterns, including inventory-first modernization, proxy-based termination, dual certificates, hybrid tunnels, algorithm-policy abstraction, and controlled fallback. Evaluation criteria integrate security, interoperability, latency, throughput, bandwidth, memory, certificate issuance, operational resilience, and rollback readiness. The findings indicate that successful migration depends on treating cryptography as a continuously governed enterprise capability rather than a fixed protocol configuration. The paper concludes by identifying gaps in standardization, automated discovery, cross-vendor testing, cryptographic telemetry, constrained-device support, and lifecycle evidence, providing organizations with a structured foundation for prioritized, reversible, and verifiable post-quantum transformation across heterogeneous digital services. Keywords: Crypto-Agility, Hybrid Cryptography, Post-Quantum Cryptography, Public Key Infrastructure, Quantum-Safe Migration, Transport Layer Security.
Advancements in quantum computing create substantial risks for classical cryptographic systems, particularly RSA and Elliptic-Curve Cryptography, that underpin FIDO2 and WebAuthn authentication protocols. Shor's algorithm can compromise these systems by extracting private keys from their public counterparts when sufficiently powerful quantum computers exist. Passwordless authentication has grown increasingly prevalent, with FIDO2 and WebAuthn serving as core trust elements within digital identity architectures. Quantum-enabled attackers present serious challenges to both credential security and attestation validation processes. Organizations must adopt post-quantum cryptographic methods proactively to sustain authentication integrity while maintaining existing trust structures. The harvest-now-decrypt-later paradigm presents urgent risks where malicious entities intercept and store authentication traffic for future decryption upon quantum computer maturation. FIDO2 credentials embedded within authenticators or bound to user devices maintain long lifespans, often synchronized across cloud ecosystems as passkeys, creating extended vulnerability windows. Post-quantum migration represents both cryptographic enhancement and essential lifecycle management spanning authenticators, browsers, servers, and attestation authorities. This framework proposes a crypto-agile hybrid WebAuthn architecture integrating classical and post-quantum algorithms. Embedding ML-DSA for digital signatures and ML-KEM for key encapsulation within WebAuthn registration and authentication flows enables progressive credential rotation without disrupting trust chains. The architecture aligns with CBOR Object Signing and Encryption identifiers and emerging IETF post-quantum WebAuthn specifications, ensuring standards compliance.
Enterprise databases routinely hold records — financial ledgers, electronic health records, genomic biobank entries, government archives — whose confidentiality must survive for decades, yet the asymmetric key-wrapping operations that protect them today (RSA and elliptic-curve key exchange inside transparent data encryption, TDE) are efficiently broken by a sufficiently large quantum computer running Shor's algorithm. Published resource estimates for that attack have fallen roughly three orders of magnitude in thirteen years — from approximately 10^9 physical qubits in 2012 to under 10^6 in 2025 — and the harvest-now-decrypt-later (HNDL) threat means an adversary can exfiltrate encrypted backups today and decrypt them once such a machine exists. A record's effective confidentiality horizon is therefore bounded by whichever comes first: its retention obligation, or the arrival of a cryptographically relevant quantum computer (CRQC). This paper studies that boundary at the key-management layer specifically, since bulk symmetric encryption (AES-256) already resists Grover's algorithm and is out of scope. We present a lattice-based post-quantum envelope-encryption architecture that replaces the RSA/ECC key-wrapping tier of a conventional TDE key hierarchy with a hybrid ML-KEM/classical key-encapsulation combiner, authenticates key-rotation metadata with ML-DSA or FN-DSA signatures over a hash-chained audit log, and negotiates between classical-only, hybrid, and pure post-quantum modes under policy control. The design is grounded in the Module-LWE and NTRU-lattice hardness assumptions behind NIST's finalized ML-KEM (FIPS 203) and ML-DSA (FIPS 204) and the still-draft FN-DSA (FIPS 206); we give seven explicit algorithms — hybrid encapsulation and decapsulation, enterprise-scale rekeying, signed audit and verification, crypto-agility negotiation, and exposure-ranked migration scheduling — with a composed security argument and an analytical cost model calibrated against published lattice-scheme parameters. That model puts the hybrid combiner's overhead at a modeled 9.0% added latency per key-rewrap relative to an all-classical baseline (12% at the highest NIST security level); shows full-estate rekeying of ten million keys falling from over ten hours at one worker to under ninety seconds at 512 parallel workers; and projects a signed, ML-DSA-authenticated ten-year audit trail for one thousand tenants at roughly 400 MB — about thirteen times an ECDSA baseline — a gap FN-DSA's compact, still-draft signatures narrow to roughly 100 MB. Four illustrative case studies — a 30-year financial ledger, a 50-year health/device archive, a 60-year genomic biobank, and a multinational deployment under CNSA 2.0 and EU deadlines — show migration completing in well under an hour of modeled compute for every estate, yet the two longest-horizon records would carry 41 to 57 years of residual exposure under Mosca's inequality if that migration were skipped: the key-management tier, not the migration's computational cost, is the binding constraint. The paper closes by positioning the framework against current mandates (NIST, NSA CNSA 2.0, the 2026 U.S. federal schedule, and the EU roadmap) and naming the engineering work — constant-time FN-DSA, HSM firmware support, and empirical validation — that separates this analytical architecture from a production deployment.