We apply the Information-Theoretic Unification (ITU) framework (Terada 2026, concept DOI 10.5281/zenodo.20109209; current version v2.0.0 at 10.5281/zenodo.20133709) to cryptography. The ITU axiom δS = δ⟨K⟩ simultaneously governs noise correction (quantum error correction, QECC) and adversary protection (cryptography); these are dual applications of the same information-protection principle. This is Tier 1 paper #3, completing the ITU engineering triangle of Quantum Computing (Tier 1 #1, DOI 10.5281/zenodo.20139391), Machine Consciousness / ASI (Tier 1 #2, DOI 10.5281/zenodo.20150501), and Cryptography. Phase 51: Establishes the ITU foundation. Shannon's perfect-secrecy theorem (one-time pad), BB84 information-theoretic security, and post-quantum computational security all follow from the ITU axiom applied to adversary-resilient code design. We numerically verify Shannon's bound (I(M;C) ~ 0 when H(K) ≥ H(M)) and reproduce the 11% BB84 security threshold. Phase 52: BB84 detailed analysis with photon loss and decoy-state protocol. Standard BB84 supports ~200 km fibre links at practical rates. We propose a naive ITU enhancement (embed the [[5,1,3]] code from Tier 1 #1 in transmitted photons) and report a HONEST NEGATIVE FINDING: the naive 5-to-1 embedding underperforms standard BB84 because overhead dominates the loss-recovery gain. This refines the ITU prescription — protective code embedding must respect channel-specific overhead trade-offs. Phase 53: Lattice-based post-quantum cryptography (CRYSTALS-Kyber, CRYSTALS-Dilithium, NIST 2024 standards). A toy LWE KEM is implemented and verified; exponential brute-force scaling is observed. Kyber-1024 provides ~256/240-bit (classical/quantum) security, future-proof through the 2050s. We propose an ITU 3-TIER cryptographic framework: Tier 1 classical (AES-256), Tier 2 quantum-safe (PQC + QKD), Tier 3 ASI-safe (Φ_ITU-embedded protocols). Serial application yields combined 584-768-bit security against adversaries up to ASI. Phase 54: Synthesis into a 2024-2040 cryptography migration roadmap with: PQC adoption timeline (mainstream by 2029) QKD network deployment (~500 cities by 2040) Cost estimates by organisation type (individual to military, spanning $0 to ~$500B) Quantum-computer capability vs crypto-threshold projection 10 falsifiable predictions (Kyber-1024 secure to 2050; ASI cryptanalysis ∝ Φ_ITU; etc.) Policy recommendations at national, corporate, and individual levels Central thesis: under ITU, cryptography is the DUAL of quantum error correction, both governed by δS = δ⟨K⟩; a 3-tier defence-in-depth is the optimal response to the ASI-era threat landscape (ITU central prediction: ASI by 2030). Includes 4 theory documents, 4 Python numerical experiments, 4 figures, 4 JSON summaries, paper metadata. Total runtime ~2 minutes on a modern laptop.
We apply the Information-Theoretic Unification (ITU) framework (Terada 2026, concept DOI 10.5281/zenodo.20109209; current version v2.0.0 at 10.5281/zenodo.20133709) to cryptography. The ITU axiom δS = δ⟨K⟩ simultaneously governs noise correction (quantum error correction, QECC) and adversary protection (cryptography); these are dual applications of the same information-protection principle. This is Tier 1 paper #3, completing the ITU engineering triangle of Quantum Computing (Tier 1 #1, DOI 10.5281/zenodo.20139391), Machine Consciousness / ASI (Tier 1 #2, DOI 10.5281/zenodo.20150501), and Cryptography. Phase 51: Establishes the ITU foundation. Shannon's perfect-secrecy theorem (one-time pad), BB84 information-theoretic security, and post-quantum computational security all follow from the ITU axiom applied to adversary-resilient code design. We numerically verify Shannon's bound (I(M;C) ~ 0 when H(K) ≥ H(M)) and reproduce the 11% BB84 security threshold. Phase 52: BB84 detailed analysis with photon loss and decoy-state protocol. Standard BB84 supports ~200 km fibre links at practical rates. We propose a naive ITU enhancement (embed the [[5,1,3]] code from Tier 1 #1 in transmitted photons) and report a HONEST NEGATIVE FINDING: the naive 5-to-1 embedding underperforms standard BB84 because overhead dominates the loss-recovery gain. This refines the ITU prescription — protective code embedding must respect channel-specific overhead trade-offs. Phase 53: Lattice-based post-quantum cryptography (CRYSTALS-Kyber, CRYSTALS-Dilithium, NIST 2024 standards). A toy LWE KEM is implemented and verified; exponential brute-force scaling is observed. Kyber-1024 provides ~256/240-bit (classical/quantum) security, future-proof through the 2050s. We propose an ITU 3-TIER cryptographic framework: Tier 1 classical (AES-256), Tier 2 quantum-safe (PQC + QKD), Tier 3 ASI-safe (Φ_ITU-embedded protocols). Serial application yields combined 584-768-bit security against adversaries up to ASI. Phase 54: Synthesis into a 2024-2040 cryptography migration roadmap with: PQC adoption timeline (mainstream by 2029) QKD network deployment (~500 cities by 2040) Cost estimates by organisation type (individual to military, spanning 0to500B) Quantum-computer capability vs crypto-threshold projection 10 falsifiable predictions (Kyber-1024 secure to 2050; ASI cryptanalysis ∝ Φ_ITU; etc.) Policy recommendations at national, corporate, and individual levels Central thesis: under ITU, cryptography is the DUAL of quantum error correction, both governed by δS = δ⟨K⟩; a 3-tier defence-in-depth is the optimal response to the ASI-era threat landscape (ITU central prediction: ASI by 2030). Includes 4 theory documents, 4 Python numerical experiments, 4 figures, 4 JSON summaries, paper metadata. Total runtime ~2 minutes on a modern laptop.
We apply the Information-Theoretic Unification (ITU) framework (Terada 2026, concept DOI 10.5281/zenodo.20109209; current version v2.0.0 at 10.5281/zenodo.20133709) to fault-tolerant quantum computing. Phase 5 of ITU established that bulk locality in AdS/CFT is mathematically equivalent to a quantum error correction code (QECC); here we exploit the reverse direction — using the ITU axiom δS = δ⟨K⟩ to derive optimal QECC architectures for practical quantum computation. This is a Tier 1 application paper, complementary to the Tier 0 core ITU theory. It is the first in a planned series of focused application papers (ITU + AI, ITU + cancer biology, ITU + economics, etc.), each as an independent Zenodo deposit linked via isSupplementTo relations to the core ITU concept DOI. Phase 43: [[5,1,3]] perfect quantum code — the discrete realization of bulk locality in AdS₃/CFT₂ (Pastawski-Yoshida-Harlow-Preskill HaPPY code building block) — verified as a complete fault-tolerant primitive: 4 stabilizers, code distance d = 3, all 15 single-qubit Pauli errors yield distinct syndromes, decoder lookup table of size 16 maps every syndrome to its corrective operation, and the encoded logical error rate is below the bare-qubit rate at physical error rates up to 25%. Phase 44: Toric/surface code threshold simulated for L = 3, 5, 7 (18, 50, 98 qubits) under independent bit-flip noise. Empirical threshold p_c ≈ 0.045 with a greedy nearest-neighbor decoder (theoretical perfect-MWPM threshold ~0.103); exponential error suppression with lattice size confirmed. The toric code is the discrete realization of AdS₃/CFT₂ bulk locality at finite size. Phase 45: Magic state distillation (Bravyi-Kitaev 5-to-1 protocol) verified using the same [[5,1,3]] code from Phase 43. Fit slope = 1.98 (theoretical 2.0; quadratic suppression confirmed), coefficient c ≈ 10, threshold ε_th ≈ 0.129. Iterated distillation converges to machine precision (10⁻¹⁶) in 4-6 rounds below threshold. This completes the path from Clifford to universal fault-tolerant computation. Phase 46: NISQ-era resource estimates for 11 hardware platforms (IBM Heron R1, IBM Condor, IBM Flamingo, IBM Kookaburra, Google Willow, Google projected 2026, IonQ Forte, IonQ Tempo, Quantinuum H2, Quantinuum H3 projected, Rigetti Ankaa-3). At physical error rate p = 10⁻³ (current best), standard surface code requires distance d = 11 (302 physical qubits per logical qubit). A hypothetical ITU-optimised code with 2× threshold improvement reduces this to d = 9 (202 physical qubits per logical qubit), a 40-60% overhead reduction. IBM Kookaburra (2026, 4158 qubits) is projected to support 13 logical qubits with standard codes, 20 with ITU-optimised codes. Central thesis: the same single information-theoretic axiom that yields emergent spacetime (ITU Phases 1-32), life (Phases 33-39), and consciousness (Phases 41-42) also yields practical quantum-computing primitives ready for near-term hardware deployment. ITU is not merely a theoretical TOE but a constructive framework that can be applied to engineering problems. Includes 4 theory documents (Markdown), 4 Python numerical experiments, 4 result figures, 4 JSON summaries, paper metadata (CITATION.cff, .zenodo.json, README). Total runtime ~30 seconds on a modern laptop.
This is Tier 1 paper #31 of the Information-Theoretic Unification (ITU) programme (Terada 2026; concept DOI 10.5281/zenodo.20109209; Tier 0 v3.0 at 10.5281/zenodo.20200156). It is the FIRST paper of the Pass-1 extension, completing Block A (physics deepening) to 100% by adding K_photon as the optics and photonics K-state. It follows #30 Genomics (DOI 10.5281/zenodo.20257528). Introduces K_photon across 7 sub-states: K_photon_basic, K_photon_coherence, K_photon_entanglement, K_photon_comm, K_photon_bio, K_photon_QG, K_photon_compute. Phase 220 establishes Maxwell electromagnetism + photon + Bell foundation: c = 1/sqrt(mu0*eps0) verified to 99.999%; photon energy spectrum from radio 10^6 Hz to gamma-ray 10^20 Hz; Bell-CHSH inequality classical limit |S| <= 2 vs Tsirelson quantum bound 2*sqrt(2) approximately 2.828; Aspect 1982 result S = 2.697 violating classical bound; Aspect-Clauser-Zeilinger Nobel Physics 2022 for experiments with entangled photons. ITU thermal -> coherent ratio = 1.000. Phase 221 develops laser physics, coherence, and BEC: Maiman ruby laser 1960; Townes maser Nobel 1964; Glauber coherent state |alpha> Nobel 2005 (with Hänsch-Hall optical frequency comb); Wieman-Cornell-Ketterle BEC Nobel 2001 (Rb-87 T_c = 170 nK, Na-23 200 nK); Nakamura blue InGaN Nobel 2014; Mourou-Strickland CPA petawatt Nobel 2018; Klaers-Weitz photon BEC at room temperature 2010 Nature. Photon statistics g^2(0) = 2 (thermal), 1 (coherent), 0 (single photon). Phase 222 covers quantum entanglement and teleportation: EPR 1935, Schrödinger entanglement 1935 (Verschränkung), Bell 1964 theorem, CHSH 1969, Clauser-Freedman 1972 first Bell violation, Aspect 1982 time-switching, Hensen 2015 loophole-free, cosmic Bell tests. Bouwmeester 1997 first quantum teleportation Nature, Micius satellite 1200 km entanglement distribution (Pan Jianwei 2017), 7600 km Beijing-Vienna inter-satellite 2018, GHZ 30+ photonic qubits 2024. Phase 223 documents optical fiber + QKD + quantum internet: Kao optical fiber theory 1966 Nobel 2009 (half with Boyle-Smith CCD); NICT 402 Tbps record 2024 (S+C+L+U band multi-band); 1.3M km global submarine cable infrastructure; Bennett-Brassard BB84 1984 with theoretical 50% basis sift rate; Ekert 1991 E91 entanglement-based; QBER threshold 11% for security; commercial QKD (ID Quantique, Toshiba, QuantumCTek, MagiQ); China national quantum backbone 4600 km 2022; Holevo 1973 bound (quantum channel capacity > classical); Wehner-Elkouss-Hanson 2018 six-stage quantum internet roadmap. Phase 224 reviews optogenetics + fluorescence + super-resolution microscopy: Shimomura-Chalfie-Tsien GFP Nobel 2008 with quantum yield 0.79 and fluorescent protein palette (BFP/CFP/GFP/YFP/mCherry/iRFP); Abbe diffraction limit 200 nm (1873); Betzig-Hell-Moerner super-resolution Nobel 2014 (STED, PALM, STORM); MINFLUX 2 nm resolution (Hell 2017); Henderson-Frank-Dubochet Cryo-EM Nobel 2017 with atomic resolution 0.3 nm; Boyden-Deisseroth optogenetics 2005 (ChR2 470 nm excite, NpHR 580 nm inhibit); GenSight RPE65 first optogenetic therapy clinical trial 2021 (partial vision recovery). Phase 225 covers LIGO gravitational waves + EHT black hole imaging + quantum gravity optics: LIGO Hanford+Livingston 4 km interferometers with strain sensitivity 10^-21 at 100 Hz; GW150914 first detection 2015 (BH-BH 36+29 -> 62 solar masses, 3 solar masses radiated as GW); Weiss-Barish-Thorne Nobel Physics 2017; GW170817 NS-NS merger with multi-messenger (LIGO/Virgo + Fermi GBM gamma-ray + optical kilonova in NGC 4993 + X-ray + radio afterglow); EHT M87* 42 microarcsec shadow 2019, Sgr A* 52 microarcsec 2022; GR shadow/r_s ratio = sqrt(27) ~ 5.196 matched by EHT observation; Al+ optical clock 9.4*10^-19 precision NIST 2019; BMV 2017 levitated nanosphere quantum gravity experimental proposal. Phase 226 covers silicon photonics + photonic computing: Silicon photonics bandwidth evolution from Intel 1 Gbps 2004 to NVIDIA 800 Gbps 2025 and co-packaged optics 1.6 Tbps 2024; photonic NN energy 1 fJ/op (1000x advantage over GPU 1 pJ/op); KLM linear-optical quantum computing 2001 Nature; Aaronson-Arkhipov boson sampling theory 2010 (#P-hard classically); Jiuzhang 1.0 76 photons 2020 USTC; Jiuzhang 2.0 113 photons 2021 (quantum advantage claim); Xanadu Aurora 12,000 photons 2024. Phase 227 integrates K_photon: 31-vertex polytope (336 edges, top deg = 30, mean degree 21.68). #31 strong couplings: #1 QC (0.95 photonic qubit), #14 Comm (0.95 fiber 402 Tbps), #25 Info/Holo (0.95 Bell + ER=EPR), #17 QG (0.90 LIGO), #18 BH (0.90 EHT), #28 Neuro (0.90 optogenetics), #30 Genome (0.85 Cryo-EM AlphaFold). Average coupling 0.890 — highest in all Pass-1. ITU axiom delta S = delta <K> verified to machine precision (1.000000) in 7+ photonic contexts: photon statistics transitions (thermal/coherent/Fock), optogenetic excitation and inhibition, LIGO strain readout, EHT black hole shadow imaging, photonic neural network computation, boson sampling quantum advantage. Ten falsifiable predictions for 2026-2030 (P_avg = 0.775 — HIGHEST in all Pass-1, Strong/Medium/Weak = 8/2/0): LIGO O5 BH 1/week detection 2026 (P=0.85), Co-packaged optics 1.6T deployed 2027 (P=0.85), QKD + PQC hybrid standard 2028 (P=0.85), Photonic quantum advantage new task 2027 (P=0.75), Optical clock km-scale GR test 2028 (P=0.80), MINFLUX subcellular real-time 2028 (P=0.80), PB-class fiber single pair 2028 (P=0.80), Atom interferometer GPS-free 2028 (P=0.75), Optogenetic neural prosthesis FDA approval 2030 (P=0.65), BMV quantum gravity experiment 2030 (P=0.65). Grand P_avg = 0.775. Central thesis: K_photon is the universal information carrier connecting physics, biology, computing, and astronomy. The ITU axiom delta S = delta <K> specializes to K_photon as the optics backbone, unifying Maxwell electromagnetism, quantum entanglement, laser coherence, QKD, optogenetics, gravitational wave detection, and photonic computing under one principle. ITU axiom verified to machine precision across 7+ photonic contexts. Block A physics deepening 100% COMPLETE. Ten Nobel Prizes featured (highest density of any Pass-1 paper): Einstein 1921 (photoelectric), Shimomura-Chalfie-Tsien 2008 (GFP), Kao 2009 (fiber optics), Betzig-Hell-Moerner 2014 (super-resolution), Nakamura 2014 (blue LED), Weiss-Barish-Thorne 2017 (gravitational waves), Henderson-Frank-Dubochet 2017 (cryo-EM), Mourou-Strickland 2018 (CPA), Aspect-Clauser-Zeilinger 2022 (Bell tests), Baker-Hassabis-Jumper 2024 (AlphaFold).
accelerating development of quantum computing has profoundly altered long-standing assumptions about computational hardness that underpin classical public-key cryptography. Algorithms such as Shor’s polynomial-time approach to integer factorization and discrete logarithms have demonstrated, at least in theory, that cryptographic primitives based on number-theoretic problems are fundamentally vulnerable in a future where large-scale quantum computers become operational (Shor, 1997). This realization has catalyzed a global shift toward post-quantum cryptography, a domain dedicated to designing and analyzing cryptographic systems that remain secure against both classical and quantum adversaries. Within this broad transformation, the Internet of Things occupies a uniquely sensitive position. IoT ecosystems combine massive device heterogeneity, constrained computational resources, long device lifetimes, and high-stakes security requirements related to privacy, safety, and critical infrastructure. Consequently, the transition to quantum-resistant cryptography in IoT environments is not merely a matter of algorithmic substitution, but a systemic challenge involving protocol design, standardization, performance trade-offs, and long-term trust. This article presents an extensive, theory-driven research study that examines post-quantum cryptography for IoT through three interlinked lenses: foundational cryptographic paradigms, particularly code-based and lattice-based constructions; evolving standardization efforts, especially those coordinated by the National Institute of Standards and Technology; and applied security considerations across emerging network architectures such as fifth- and sixth-generation wireless systems, edge computing, and blockchain-enabled IoT. Drawing strictly on the provided scholarly references, the article situates code-based cryptography as one of the earliest and most conceptually resilient post-quantum approaches, emphasizing its relevance to long-lived IoT deployments where conservative security margins are valued (Sendrier, 2018). At the same time, it critically evaluates lattice-based schemes that currently dominate standardization trajectories due to their versatility and comparatively efficient implementations (W. S. P., 2022; NIST, 2024a). Methodologically, the study adopts a qualitative, interpretive research design grounded in comparative literature analysis and theoretical synthesis. Rather than presenting experimental benchmarks or numerical evaluations, it systematically interprets reported findings across surveys, protocol proposals, and standards documents to identify recurring patterns, tensions, and unresolved questions. The results section articulates how post-quantum algorithms interact with IoT-specific constraints, revealing a persistent trade-off between cryptographic robustness, computational overhead, and deployment feasibility (Boneh, 2020; Karakaya & Ulu, 2024). The discussion then deepens this analysis by engaging with scholarly debates on algorithmic diversity, cryptographic agility, and the socio-technical implications of premature or fragmented adoption. Ultimately, the article argues that securing the IoT in the post-quantum era requires more than selecting standardized algorithms. It demands an integrated research agenda that reconciles theoretical security assurances with real-world operational contexts, anticipates future advances in both quantum computing and cryptanalysis, and aligns global standardization with local deployment realities. By offering an expansive and critical synthesis of post-quantum cryptography for IoT, this work contributes a comprehensive academic foundation for researchers, standards bodies, and practitioners navigating one of the most consequential transitions in contemporary information security.
Classical cryptography has been around for a long time in the documented human history, but most classical ciphers were broken and even solved by hand. Shannon introduced the notion of perfect secrecy that formally defines confidentiality in the information-theoretic sense, which is only possible in the restricted scenarios where the message is no longer than the encryption key. The invention of public-key cryptography (the Diffie-Hellman key exchange protocol in 1976 and the RSA crypto-system in 1977) marks the birth of modern cryptography, allowing parties to exchange messages securely without sharing any secrets in advance. Furthermore, it provides computational security based on the conjectured hardness of mathematical problems such as factorization and the discrete logarithm. Public-key cryptography has found numerous applications in the Internet, financial and banking industry, and blockchains, and it plays a crucial role in protecting information security and asset safety. Unfortunately, in the 1990s, Shor proposed efficient quantum algorithms that solve number-theoretic problems, including factorization and discrete logarithms in polynomial time. Once a quantum computer of a particular scale becomes a reality, it will cause a devastating blow to the existing public-key infrastructure. To deal with such a ‘quantum crisis’, academia and industry are looking into the design, analysis and standardization of cryptographic algorithms that can resist quantum computers referred to as post-quantum cryptography (PQC). The National Institute of Standards and Technology (NIST) has been soliciting proposals for the post-quantum public-key algorithms since 2016. More recently, the Chinese Association for Cryptologic Research (CACR) held a competition on designing cryptographic algorithms whose public-key cryptography track focused on post-quantum cryptographic algorithms. Lattice-based cryptography is considered by most to be the mainstream technical route of post-quantum cryptography, which is reflected in the number of proposals (and their percentage of the total) received in the NIST PQC process. To reflect the status quo of post-quantum cryptography, we invite leading experts in this area to contribute three technical perspectives that aim to help readers understand the algorithms, the underlying basic techniques and different technical routes to achieve quantum resistance. The first perspective, presented by Lu and Zhang, introduces public-key cryptographic algorithms whose quantum security is reducible from the conjectured quantum hardness of lattice problems. In particular, they mainly focus on public-key encryption (PKE) and the key encapsulation mechanism (KEM), which are essential building blocks for securing the confidentiality of communication without pre-shared secrets. Both types of crypto-systems are solicited by the NIST PQC standardization and the CACR algorithm design competition. This perspective gives a comprehensive survey on practical lattice-based PKEs/KEMs, and their best-known quantum and classical attacks. Another important post-quantum crypto-system is digital signature, which ensures that three goals of information security are met other than confidentiality, namely, integrity, authentication and non-repudiation. The second perspective is on lattice-based signature by Lyubashevsky. In this perspective, he surveys different techniques in building lattice-based post-quantum crypto-systems, discusses the challenges in overcoming performance issues and gives us state-of-the-art digital signature schemes. In addition to ensuring the ‘static’ security of information in storage and transmission, advanced cryptographic algorithms and protocols can guarantee information security during the computation process (possibly among multiple parties), referred to as privacy-preserving computation. Cryptographic techniques involved in privacy-preserving computation include secure multi-party computation, zero-knowledge proof and fully homomorphic encryption. There is a pressing need to migrate them to the post-quantum era. The third perspective, by Yu and Xie, presents practical instantiations of these algorithms and discusses possible ways to migrate them to their quantum-resistant counterparts. To summarize, post-quantum cryptography has received widespread attention and made significant progress in recent years. Some post-quantum cryptographic algorithms, such as the lattice-based candidate, also have other advantages (e.g., computational efficiency and full homomorphism) over their classical counterparts. Lattice-based cryptography is an emerging field with high theoretical value and wide application, and we encourage young researchers to enter and explore this new and exciting field.
The conventional cryptographic systems that underpin the world's financial infrastructure are under grave threat as quantum computing spreads. The financial industry must immediately investigate quantum-safe alternatives, as widely used public-key algorithms such as RSA and Elliptic Curve Cryptography (ECC) are theoretically susceptible to Shor's quantum algorithm, while symmetric schemes face reduced security margins under Grover's algorithm. The Systematic Literature Review (SLR) presented in this paper was carried out in compliance with PRISMA 2020 guidelines. Web of Science, Scopus, and Google Scholar were searched using Boolean keywords to find articles published between 2013 and 2025. 53 high-quality studies were chosen from an original corpus of N = 1,654 publications utilizing the Mixed Methods Appraisal Tool (MMAT), systematic screening, and eligibility evaluation. Three main paradigms for quantum cryptography were found: Post-Quantum Cryptography (PQC), which includes the NIST-standardised lattice-based algorithms CRYSTALS-Kyber and CRYSTALS-Dilithium (NIST, 2022); Quantum Key Distribution (QKD), which offers information-theoretic security through the BB84, E91, and CV-QKD protocols; and hybrid quantum-classical architectures that combine near-term deployment with long-term quantum resilience. The operational viability of quantum-secure financial communication has been confirmed through real-world deployments by JPMorgan Chase, HSBC, CaixaBank, and Danske Bank. Given the 'harvest now, decrypt later' (HNDL) threat paradigm, the evidence clearly shows that upgrading to quantum-safe cryptography is an essential operational necessity. Complementary approaches with different trade-offs in cost, scalability, and implementation maturity include QKD, PQC, and hybrid frameworks. To protect the integrity of international financial systems, financial regulators and institutions must coordinate faster adoption roadmaps aligned with NIST PQC standardisation timelines.