The migration to post-quantum cryptography (PQC) is widely framed as an algorithmic substitution problem: replace RSA and elliptic-curve primitives with the module-lattice schemes standardised by the United States National Institute of Standards and Technology (NIST) as ML-KEM (FIPS 203) and ML-DSA (FIPS 204). This paper argues that such a framing constitutes a locks-versus-the-archive fallacy. Adversaries practising harvest-now-decrypt-later (HNDL) strategies have already rendered perimeter-centric defences obsolete; changing cryptographic locks does nothing to protect the exabytes of ciphertext previously exfiltrated. The true enterprise and sovereign challenge is architectural. Four coupled claims are developed. First, security must shift from network perimeters to data-level resilience through genuine crypto-agility—the capacity to hot-swap primitives across legacy lakes without breaking application programming interfaces, compliance pipelines or availability. Second, infrastructure is speciating into three physical forms: silicon halls for hot compute, molecular halls for deep archival storage, and sovereign caches as jurisdictional vaults. Third, as enterprises become agentic systems, the post-quantum transition becomes a crisis of memory integrity; vector indices must be decoupled from narrative payloads and every memory block must carry a post-quantum chain of custody if narrative poisoning is to be prevented. Also available on Academia.edu: https://www.academia.edu/attachments/134136036/download_file?s=portfolio
The migration to post-quantum cryptography (PQC) is widely framed as an algorithmic substitution problem: replace RSA and elliptic-curve primitives with the module-lattice schemes standardised by the United States National Institute of Standards and Technology (NIST) as ML-KEM (FIPS 203) and ML-DSA (FIPS 204). This paper argues that such a framing constitutes a locks-versus-the-archive fallacy. Adversaries practising harvest-now-decrypt-later (HNDL) strategies have already rendered perimeter-centric defences obsolete; changing cryptographic locks does nothing to protect the exabytes of ciphertext previously exfiltrated. The true enterprise and sovereign challenge is architectural. Four coupled claims are developed. First, security must shift from network perimeters to data-level resilience through genuine crypto-agility—the capacity to hot-swap primitives across legacy lakes without breaking application programming interfaces, compliance pipelines or availability. Second, infrastructure is speciating into three physical forms: silicon halls for hot compute, molecular halls for deep archival storage, and sovereign caches as jurisdictional vaults. Third, as enterprises become agentic systems, the post-quantum transition becomes a crisis of memory integrity; vector indices must be decoupled from narrative payloads and every memory block must carry a post-quantum chain of custody if narrative poisoning is to be prevented. Also available on Academia.edu: https://www.academia.edu/attachments/134136036/download_file?s=portfolio
These interview talking points open on the locks-versus-the-archive fallacy: treating post-quantum cryptography as a software migration does not protect historically stolen data. They state that harvest-now-decrypt-later is already underway, with encrypted enterprise archives being hoarded pending a later break of current encryption, and that security has to move from perimeter defence to data-level resilience so the archive can survive independently of who holds the transient keys. They then describe data-centre speciation into three forms: silicon compute (hot, GPU-dense infrastructure for real-time AI), molecular halls (DNA or synthetic-polymer archives for permanent, zero-power retention), and sovereign caches (geopolitically bound, physically air-gapped, jurisdictionally hardened local vaults). Interview talking points by Dr. Syed Muntasir Mamun, ORCID 0000-0001-6845-2853.
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.
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.
The advent of cryptanalytically relevant quantum computers (CRQCs) threatens the foundational mathematical hardness assumptions of contemporary public-key cryptography. In response, Post-Quantum Cryptography (PQC) has emerged, predominantly framed through an epistemic lens of "algorithmic substitution"—replacing vulnerable algorithms with quantum-resistant ones. However, for sovereign entities and developing digital infrastructures, this universalist approach is insufficient. This paper conducts a deep epistemic analysis of the shift toward layered architectural resilience, cognitive sovereignty, and cybernetic governance. It proposes a foundational set of normative principles for a sovereign PQC protocol and systematically compares ten competing theories in cryptography, digital sovereignty, and data architecture. K Also available on Academia.edu: https://www.academia.edu/attachments/134141335/download_file?s=portfolio
Fault-tolerant quantum computing will render RSA and ECC insecure by reducing their underlying mathematical hard problems to polynomial-time computation via Shor's algorithm. The urgency of migrating to NIST post-quantum cryptography (PQC) standards is compounded by Harvest Now, Decrypt Later (HNDL) attacks, in which adversaries archive encrypted traffic today for quantum decryption once capable hardware matures. A uniform substitution of classical primitives with lattice-based alternatives, however, creates deployment friction that existing migration guidance does not fully resolve. ML-KEM-1024 encapsulation keys (1,568 bytes) and ML-DSA signatures (2,420 - 4,627 bytes) can exceed the standard 1,500-byte Ethernet Maximum Transmission Unit (MTU) when combined with protocol framing overhead, and ML-DSA payloads strain the volatile memory of many deployed Hardware Security Modules (HSMs). These constraints impose measurable costs on handshake latency, packet fragmentation risk, and Zero Trust Architecture (ZTA) verification cycles. This paper makes three contributions. First, it characterizes the operational tension between lattice-based PQC primitives and existing cloud network constraints, drawing on FIPS 203, FIPS 204, FIPS 205, and current IETF transport-layer work. Second, it identifies specific failure modes this tension introduces for Zero Trust identity infrastructure. Third, it proposes a Tiered Cryptographic Agility Model: a workload-stratified migration framework that applies dual-wrap hybrid encryption to cold storage, symmetric key ratcheting to latency-sensitive microservices, and PQC-signed software gateway tokens to bridge the hardware adoption gap. The framework is positioned against the NIST SP 800-207 Zero Trust reference architecture and the deployment-security guidance of NIST SP 800-227.
The impressively fast development of quantum computing is a serious threat to classical public-key cryptography, and algorithms such as Shor's and Grover's will render RSA and elliptic curve systems essentially useless as soon as a cryptanalytically relevant quantum computer becomes available. Although it is still some way off before such machines are available, the harvest-now-encrypt-later threat highlights the need for proactive defense. In response, the National Institute of Standards and Technology (NIST) published the first post-quantum cryptography standards in 2024, including ML-KEM (Kyber) for key establishment, ML-DSA (Dilithium) for digital signatures and SLH-DSA (SPHINCS+) as a stateless hash-based alternative. This paper is a summary of the evolving post-quantum landscape, starting with the standards and their underlying security and then moving on to migration policies such as CNSA 2.0 and CISA, NSA and NIST guidance. It also looks at integration patterns for important protocols such as TLS, IPsec, SSH, and code signing. A performance, interoperability and overhead evaluation methodology is presented with results showing that hybrid deployment and crypto-agile architectures make PQC adoption a viable option. The paper concludes by providing a governance-oriented roadmap, where inventory, prioritization and pilot deployments are identified as near-term actions, with open questions remaining on performance optimization, implementation security and algorithm resilience over time.