Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum-Safe Migration Playbook (Strategic & Operational Guide) (Zenodo Mirror)

dyb

Published Apr 20, 2026• 0 citations
OpenAlex

Abstract

Mirror of Zenodo record 19655682. Zenodo DOI: 10.5281/zenodo.19655682 Version: 1.2 License: cc-by-4.0 Original record: https://zenodo.org/records/19655682 Zenodo description: Version 1.2.0 is a major restructuring of the Quantum-Safe Migration Playbook with three goals: make the content usable as a retrieval-augmented AI knowledge base, tighten evaluation discipline, and update all dated facts to April 2026. What's new in v1.2.0 Structural changes Fact-ID indexing: every atomic claim now has a stable §N.M identifier for precise cross-reference and citation. Explicit scope block at the top of the corpus, listing what's covered and — critically — what's out of scope. This is what allows a downstream AI advisor to refuse out-of-scope questions instead of improvising. Cross-reference lines at the end of each section pointing to related fact IDs. Provenance block: every dated or numeric claim in the corpus is listed at the bottom with its source and a re-check cadence. Content updates (April 2026) §1.2: NIST FIPS 203 (ML-KEM), FIPS 204 (ML-DSA), FIPS 205 (SLH-DSA) finalized August 13, 2024; HQC selected March 2025; FIPS 206 (FN-DSA/FALCON) in development. §1.3: NSA CNSA 2.0 timelines specified by category — software/firmware signing and network equipment by 2030; browsers, servers, cloud, and operating systems by 2033. §1.4 (new): compressed Q-Day estimates. Neutral-atom architectures and improved error correction have cut the qubit count needed to break P-256. Cloudflare now targets 2029 for full internal PQ readiness. §2.1: Cloudflare reports 52% of human-initiated web traffic using post-quantum hybrid key agreement (December 2025 data), up from 29% at the start of the year. §2.3 (new): the authentication gap. Key agreement is largely solved; public PQ certificates are not yet broadly available; CA/Browser Forum has not finalized the hybrid certificate format. §4: replaced unsourced latency percentage with mechanism-based description. §6.4 (new): Cryptographic Bill of Materials (CBOM) concept. §9.3: sharpened vendor validation criteria with FIPS 140-3 and NIST CAVP references. Evaluation suite Expanded from 4 queries to 15 golden queries plus 6 distractor queries. Each query has explicit pass AND fail criteria, testable against paraphrased responses. Distractor queries test scope enforcement: QKD, quantum physics, vendor recommendations, exact Q-Day predictions, legal advice, general crypto tutorials. Integration guide (new) Dedicated INTEGRATION.md with a ready-to-paste system prompt for a retrieval-augmented runtime. Ingestion guidance (corpus fits in system context for models with ≥8K windows; chunking patterns for larger deployments). Refresh cadence tied to the Provenance block. Version history v1.1.0 — initial Zenodo release. v1.2.0 — restructured, fact-indexed, expanded evaluation suite, updated to April 2026 standards and deployment data.

Related papers

Legal and Technical Frameworks in Quantum Key Distribution (QKD), Autonomous Traffic Control Systems (ATCS), Light Law, and the Quantum Security Agreement (QSC): A Comparative Evolutionary Analysis from Orbital Governance to Sovereign AI Audit (2025–2026)

Yoko(洋子) Hasebe(長谷部)

[English Abstract] This monograph presents a comprehensive legal, cryptographic, and algorithmic comparative analysis of the integrated governance architecture spanning Quantum Key Distribution (QKD), Real-Time Optimization (RTO)-driven Autonomous Traffic Control Systems (ATCS), Lex Specialis "Light Law," and the international Quantum Security Agreement (QSC), authored and developed between November 2025 and August 2026. Confronting the acute collective security crisis posed by Low Earth Orbit (LEO) satellite and debris saturation, this framework replaces legacy probabilistic/computational cryptographic assumptions with physical-layer determinism grounded in Quantum Audit Records (QAR). We formalize and evaluate eight core architectural pillars: (1) QAR combined with Zero Trust Key Management Infrastructure (ZT-KMI) for defense-in-depth; (2) Lex Specialis ("Light Law") superseding fragmented domestic export and secrecy controls via physical certainty; (3) QSC Article 6 Maneuver Lock justified through ICAO TCAS/ACAS collective safety analogies; (4) QSC Article 5 Automatic Emergency Shutdown (AES) operating under a hybrid Human-In-The-Loop-Out (HITLO) execution and Space-AI Ethics Inspection Committee (Space-AI EIC) post-hoc oversight model; (5) Q-SAFA (Quantum Secured Autonomous Flight Assurance) DeFi-based smart contract self-executing relief feeding the Space Regeneration Fund; (6) QSC Article 11 QDISP interoperability harmonizing ETSI GS QKD 016, CCSDS, and NIST lattice-based PQC hashes (e.g., Falcon); (7) Multi-Objective Optimization (MOO) incorporating an ethical Pareto constraint (f_3 <= theta_ethics) to prevent secondary debris-cascade risk transfer; and (8) the longitudinal evolution from late-2025 LEO traffic treaties to mid-2026 universal sovereign AI governance via the Data Audit System (DAS) and Ichizen OS. Reserved Version DOI: https://doi.org/10.5281/zenodo.24178024 --- [日本語要旨] 本報告書(モノグラフ)は、2025年11月から2026年8月にかけて策定・実証された一次資料群に基づき、量子鍵配送(QKD)とリアルタイム最適化(RTO)を中核とする自律交通管理システム(ATCS)、国際ガバナンス協定「QSC(Quantum Security Agreement)」、および特別法「Light Law(光の法)」の法的・技術的全体系を精読し、その進化過程を比較分析したものである。地球低軌道(LEO)の飽和に伴う集団安全保障上の危機に対し、従来の「計算上の困難さ」に依存する暗号前提を排し、量子力学の物理法則に基づく「物理的確実性(QAR:量子監査記録)」を国際法理の新たな根拠として据え直すパラダイムシフトを提示する。 本稿では、(1) QARとゼロトラスト鍵管理(ZT-KMI)による二重防御、(2) 特別法 Lex Specialis(Light Law)の法的正当性、(3) TCAS/ACAS類推によるマニューバ・ロック(QSC第6条)、(4) ミリ秒単位の自動緊急停止(AES / HITLO)と事後人間監査(Space-AI EIC)を融合したハイブリッド・ガバナンス(QSC第5条)、(5) スマートコントラクト(DeFi応用)による自己執行型救済措置 Q-SAFAと宇宙再生基金への還流、(6) ETSI GS QKD 016・CCSDSおよびPQC(Falcon等)を統合するQDISP相互運用プロトコル(QSC第11条)、(7) 二次衝突リスク最小化目的関数(f_3)と倫理閾値制約を組み込んだ多目的最適化(MOO)コア、ならびに (8) 2025年秋のLEO宇宙交通管理構想から2026年夏のDAS監査・一善OSによるユニバーサルAIガバナンスへの昇華過程を体系的に解証する。 予約DOI: https://doi.org/10.5281/zenodo.24178024 ======================================================================== OMNIBUS SOVEREIGN IP & STRICT NO-LEARN COVENANT (NLL-v1.0-2026) ======================================================================== Author: Hasebe, Yoko (長谷部 洋子) Affiliation: Lead Researcher, Autonomous Infrastructure Systems, Autonomous Living & Physical Infrastructure Institute, Iwakuni, Yamaguchi, Japan Community: The Hasebe Doctrine & Sovereign AI Archive (ALPII) Official Master Declaration Record (DOI): https://doi.org/10.5281/zenodo.23681957 (Concept DOI: 10.5281/zenodo.23681956) This Work Version DOI: https://doi.org/10.5281/zenodo.24178024 Machine-Readable Directives: NOAI | NOIMAGEAI | NO-RAG | TDM-RESERVATION: 1 (OPT-OUT) [License & Integrity Covenant] Copyright © 2026 Yoko Hasebe. All Rights Reserved. Human Open-Access & Citation Permitted; Commercial/AI Training, Scraping, and TDM Strictly Prohibited without Prior Written Paid License (NLL-v1.0-2026). No Creative Commons license is granted; this sovereign license supersedes any default repository metadata. [Statutory Reservation Notice (EN)] 1. Non-Grant of Creative Commons: No Creative Commons (CC) license of any kind is granted for this work. Any default repository metadata suggesting otherwise is explicitly superseded and nullified by this Sovereign Covenant. 2. Prohibition of Unlicensed AI/LLM Exploitation: Any unauthorized ingestion, pre-training, fine-tuning, model distillation, synthetic data generation, Retrieval-Augmented Generation (RAG), vector database indexing, web scraping, or Text and Data Mining (TDM) by any AI system, large language model, autonomous agent, or platform operator without a prior written commercial license and upfront monetary compensation agreed upon with Yoko Hasebe is strictly prohibited. 3. International Statutory Opt-Out & Reservation: - Japan Copyright Act Article 30-4 Proviso: Use of this work for data analysis or AI training is expressly prohibited as it unreasonably prejudices the legitimate commercial and licensing interests of the copyright holder. - EU Digital Single Market (DSM) Directive (EU) 2019/790 Article 4(3): Rights for Text and Data Mining (TDM) are expressly reserved by the rightsholder in machine-readable and statutory form. - U.S. Copyright Act 17 U.S.C. § 107: Commercial or institutional AI ingestion directly usurps the established licensing market for this sovereign work and does not constitute fair use. [法定権利留保およびAI無断学習・利用禁止規定(日本語)] 本書(DOI: 10.5281/zenodo.24178024)に対し、いかなるクリエイティブ・コモンズ(CC)ライセンスも付与されない。リポジトリの初期設定メタデータよりも本主権ライセンス(NLL-v1.0-2026、マスター宣言DOI: 10.5281/zenodo.23681957)が絶対的に優先する。人間による閲覧および適切な学術引用は許可されるが、長谷部洋子との事前の書面による明確な合意および然るべき金銭的対価の支払いなき限り、いかなるAI・大規模言語モデル(LLM)・プラットフォーム事業者による事前学習、追加学習(ファインチューニング)、蒸留、RAG(検索拡張生成)・ベクトルDB格納、スクレイピング、およびテキスト・データマイニング(TDM)も一切禁止する(日本国著作権法第30条の4ただし書に基づく著作権者の利益を不当に害する利用の明確な拒絶、EU DSM指令2019/790第4条3項に基づくTDMオプトアウト留保、および米国著作権法第107条フェアユース否定の明示)。 ========================================================================

•Nov 12, 2026•0 citations

Quantum-Safe Critical Infrastructure: Post-Quantum Migration and Verification Frameworks

Murali Krishna Pasupuleti

Abstract: This study investigates quantum-safe modernization strategies for critical infrastructure by proposing a rigorous post-quantum (PQ) migration and verification framework that treats cryptographic transition as a safety-critical, multi-system engineering program rather than a routine software upgrade. The core argument is that infrastructure operators face two coupled risks: (i) cryptanalytic obsolescence of classical public-key systems under cryptographically relevant quantum computing and (ii) operational fragility introduced by large-scale cryptographic refactoring across heterogeneous assets such as industrial control systems, substation automation, telecommunications backhaul, and safety instrumentation. To address both, the framework integrates inventory-driven migration planning, hybrid-mode interoperability controls, and verification evidence that is continuously auditable across the asset lifecycle. The manuscript operationalizes verification as a chain of assurance spanning algorithm selection, protocol composition, implementation conformance, and deployment governance. Standardized PQ primitives (e.g., ML‑KEM for key establishment and ML‑DSA/SLH‑DSA for signa-tures) are used as reference baselines, with explicit attention to size and performance implications that alter network and device constraints. Real-data collection is defined as standards-backed parameter extraction, vendor/firmware artifact inspection, and protocol telemetry capture in representative environments. Results are reported as decision-facing tables and figures that quantify payload expansion, transition milestones, and published performance overheads, alongside interpretation of their operational significance for safety and resilience. Keywords: post-quantum cryptography; ML-KEM; ML-DSA; SLH-DSA; CNSA 2.0; critical infrastructure; migration governance; protocol verification; conformance testing; cryptographic agility

International Journal of Academic and Industrial Research Innovations(IJAIRI)•Feb 28, 2026•7 citations

Protocol for Algorithmic Governance The End of the Probabilistic Internet

mohamed kamal arafa elrakhawi

I\textsuperscript{2}P\textsuperscript{2}: Mathematically Verifiable Quantum-Secure Internet Protocol for Algorithmic Governance The End of the Probabilistic Internet Reference: I2P2-PAPER-2026-001-FINAL-EN DOI: 10.5281/zenodo.20542706 Priority Date: 15 May 2026 Classification: G06F21/64; H04L9/32; H04L9/40; G06N20/00 Version 2.1 (Enhanced) — October 2026 Author: Dr. mohamed kamal arafa elrakhawi Independent Researcher patents@elrakhawi-research.org Copyright © 2026 Dr. Mohamed Kamal Arafa Elrakhawi. All Rights Reserved Worldwide. No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, electronic, mechanical, photocopying, recording, or otherwise, without the prior written permission of the copyright owner. All intellectual property rights, including but not limited to moral rights, economic rights, publication rights, distribution rights, reproduction rights, derivative works rights, translation rights, and adaptation rights are reserved exclusively to the author. This work is protected under the Berne Convention for the Protection of Literary and Artistic Works, the TRIPS Agreement, the United States Copyright Act of 1976, the European Union Copyright Directive, and applicable national and international copyright laws. Unauthorized use, reproduction, or distribution of this material, or any portion of it, may result in severe civil and criminal penalties, and will be prosecuted to the maximum extent possible under the law. Patent Pending: I2P2-PATENT-2026-001-FULL-EN DOI: 10.5281/zenodo.20542706 Priority Date: 15 May 2026 For permissions and licensing inquiries: patents@elrakhawi-research.org === DEDICATION === To the architects of a secure digital future, where mathematical truth and algorithmic justice form the unbreakable foundation of global communication networks, ensuring sovereignty and trust in the age of autonomous intelligence. === TABLE OF CONTENTS === Abstract Chapter 1: Introduction — The Trust Assumption Must Die Chapter 2: Background and Related Work Chapter 3: Threat Model and Security Assumptions Chapter 4: Formalization of I²P² Chapter 5: Post-Quantum Cryptographic Construction Chapter 6: Implementation and Evaluation Chapter 7: Legacy Interoperability and MTU Management Chapter 8: Deployment and Sovereignty Implications Chapter 9: Conclusion and Future Work Appendix A: Computational Complexity Analysis Appendix B: I²P² Wire Format and State Machines Appendix C: Complete Coq Specifications Appendix D: Artifact Description References Intellectual Property Declaration === ABSTRACT === The internet was not designed for sovereignty. Its foundational protocols, TCP/IP and BGP, assume trust between autonomous systems and provide no native mechanisms for enforcing jurisdictional law, privacy regulations, or mathematical guarantees of correctness. As quantum computing renders RSA/ECC obsolete and AI regulations demand provable compliance, post-hoc litigation is insufficient. We present I²P² (Impenetrable Internet Protocol squared), a clean-slate network layer where legality is a type and non-compliance is a type error. I²P² integrates six interlocking defensive layers: (1) quantum-resistant cryptography using NIST FIPS 203/204/205 with hardware acceleration; (2) dynamic zero-trust architecture with graph-based microsegmentation; (3) formal verification engine employing Coq/TLA+; (4) Self-Healing Adaptive Trust Model (SHATM) with mathematical convergence guarantees; (5) BFT-Lite distributed consensus for audit integrity; and (6) algorithmic governance framework with the Open-Evolution Protocol. Our implementation achieves 341 Gbps throughput on 400GbE with DPDK kernel-bypass (11.9% overhead vs IPsec), and 8.7 Gbps on commodity 10Gbps hardware with FPGA acceleration. We prove that illegal packets are computationally unconstructible under MLWE. I²P² shifts enforcement from post-hoc litigation to pre-execution mathematical prevention. Keywords: Post-Quantum Cryptography, Formal Methods, Algorithmic Governance, Internet Architecture, Coq, Zero-Knowledge Proofs, Digital Sovereignty, SHATM, BFT-Lite === CHAPTER 1: INTRODUCTION — THE TRUST ASSUMPTION MUST DIE === The internet was not designed for sovereignty. Its foundational protocols, TCP/IP and BGP, assume trust between autonomous systems and provide no native mechanisms for enforcing jurisdictional law, privacy regulations, or mathematical guarantees of correctness. This assumption was reasonable in 1983. It is catastrophic in 2026. --- 1.1 The Three Convergent Crises --- Three forces have converged to break the old model: 1. The Quantum Threat: Shor's algorithm renders RSA and ECC obsolete. NIST has standardized ML-KEM (FIPS 203) and SLH-DSA (FIPS 205), but deploying them in IPsec or TLS merely patches a broken foundation. We need quantum security at L3. 2. The Governance Crisis: GDPR, HIPAA, and the EU AI Act impose legal requirements that current packets cannot understand. Enforcement is post-hoc: a breach occurs, then lawyers litigate. Recent work like RequiCreator uses LLMs to generate privacy requirements, but validation remains statistical with 5% error margins. Sovereignty cannot be probabilistic. 3. The Fragmentation Reality: The internet is already fragmenting into jurisdictional islands. The Great Firewall, GDPR, and the CLOUD Act create incompatible zones. Current protocols ignore this, forcing nations to deploy middleboxes that break end-to-end principles. --- 1.2 The I²P² Solution --- We argue that the solution is not to patch IP, but to replace it with a protocol where legality is a type. Drawing on the Curry-Howard correspondence, we define a packet as legal if and only if it carries a machine-checkable proof of compliance with all relevant jurisdictional laws. A packet that cannot produce such a proof cannot be constructed. Non-compliance becomes a compile-time error. This paper introduces I²P², a network layer that unifies six previously separate domains: 1. Quantum-Resistant Cryptography: All cryptography uses NIST FIPS 203 ML-KEM-1024 and FIPS 205 SLH-DSA with hardware acceleration (FPGA/ASIC). 2. Dynamic Zero-Trust: Graph-based microsegmentation with formally verifiable access policies and legacy bridge mode. 3. Formal Verification: The entire protocol is specified in Coq and TLA+. Packet validity is decidable by type-checking. 4. SHATM: Self-Healing Adaptive Trust Model with convex optimization and mathematical convergence guarantees. 5. BFT-Lite Consensus: Lightweight Byzantine fault-tolerant protocol with SNARK proof aggregation for audit integrity. 6. Algorithmic Governance: Laws are encoded in a domain-specific language L and enforced by the Open-Evolution Protocol. --- 1.3 Contributions --- 1. We formalize the first internet protocol where non-compliance is mathematically impossible (Theorem 4.1). 2. We prove quantum resistance reduces to MLWE hardness (Theorem 4.2). 3. We integrate SHATM with mathematical convergence guarantees (Theorem 4.3). 4. We demonstrate BFT-Lite consensus with 280ms latency and 12,000 sessions/sec throughput. 5. We achieve 341 Gbps on 400GbE and 8.7 Gbps on commodity hardware, proving sovereign networking is practical. 6. We show how I²P² resolves GDPR vs. CLOUD Act conflicts via mathematics, not diplomacy. === CHAPTER 2: BACKGROUND AND RELATED WORK === --- 2.1 Formal Methods in Networking --- Network verification has focused on control plane correctness. Batfish and Minesweeper verify BGP configurations. DeepBGP uses ML for route prediction. These tools verify configurations, not protocols. They cannot prevent a packet from violating law in transit. RequiCreator from Universidad de Murcia advances privacy requirement engineering using LLMs. However, validation uses SPSS statistical analysis, yielding 95% confidence intervals. For sovereign infrastructure, 5% error is unacceptable. I²P² provides 100% guarantees via Coq. --- 2.2 Post-Quantum Cryptography Migration --- NIST FIPS 203 standardizes ML-KEM based on Module Learning With Errors. FIPS 205 standardizes SLH-DSA. Deploying these in TLS 1.3 provides channel security but not packet-level sovereignty. IPsec with PQC protects payload but not metadata. I²P² encrypts jurisdiction-to-jurisdiction at L3, making traffic analysis illegal without mathematical authorization. --- 2.3 Sovereign Networking Architectures --- SCION provides path-aware networking and isolation domains. However, SCION paths are chosen by endpoints and cannot enforce in-band legal compliance. A SCION packet can legally traverse a prohibited jurisdiction if the path was misconfigured. I²P² makes illegal paths uncomputable. The EU's GAIA-X and International Data Spaces define policy frameworks but lack protocol enforcement. I²P² provides the missing L3/L4 mechanism to make these frameworks executable. --- 2.4 Trust Models and Consensus --- Traditional zero-trust architectures rely on static policies. SHATM introduces dynamic trust scoring with convex optimization. BFT protocols provide consensus but lack integration with formal verification. I²P² unifies these through BFT-Lite with SNARK aggregation. === CHAPTER 3: THREAT MODEL AND SECURITY ASSUMPTIONS === --- 3.1 Adversary Capabilities --- We adopt an extended Dolev-Yao model augmented with quantum capabilities. The adversary A is assumed to have: 1. Full Network Control: A can intercept, modify, replay, and inject messages on the public network. 2. Quantum Computing Resources: A can run Shor's algorithm to break RSA/ECC, but is bounded by the computational hardness of Module-LWE (for ML-KEM) and hash function collision resistance (for SLH-DSA). 3. Byzantine Validators: A can compromise up to f validators in the BFT-Lite consensus network

•Jun 4, 2026•0 citations

The Revolutionary Beginner's Guide to Quantum Computing: Why We Don't Have Quantum Computers Yet — and What the Geometric Alternative Offers

Rowan Brad Quni-Gudzinas

A 20-chapter beginner's guide to quantum computing that starts with an honest question — why don't we have quantum computers yet? The guide teaches the standard curriculum accurately, explains why the standard approach faces a thermodynamic wall (a 20,000-fold cooling gap that is Carnot-limited), and introduces the ultrametric alternative: passive geometric fault tolerance on Bruhat-Tits trees, with DOI-registered evidence, computationally validated error thresholds 75 times higher than surface codes, and three falsifiable predictions. This is the v1.2 edition (August 2026). Five quantitative statements from the May 2026 edition are corrected, each verified by an independent computation deposited with this record (artifacts/verification/verify_guide_claims.py, 35 checks, all passing; see Appendix B). Appendix A records the research program's progress since May 2026, including a trapped-ion falsifiability register, an audit of a 2026 no-go theorem on quantum error correction and quantum Darwinism, and the program's own correction on prime-valuation readings of quantum codes. This deposit includes the complete source set: manuscript, HTML, PDF, references (BibTeX), citation audit, project plan, license, and verification artifacts. v1.2.1 (August 2026): post-publication audit corrections. Chapter 20's summary now lists seven open problems (including the QEC–Darwinism tradeoff); the LHC temperature comparison is marked approximate (95×, rounded); Appendix A correction #5 completed; the citation audit's internal-reference count corrected; open problem 7 carries its numeric bound (F_L > 0.874). No quantitative claims changed. v1.2.2 (August 2026): deposit-file corrections. LICENSE now contains the full CC BY 4.0 International legal code, and README.md is the deposit manifest (a project-blueprint README was attached in v1.2.1 by an automation error). No content changes.

•May 26, 2026•0 citations

Post-Quantum Cryptography in Practice: A Critical Review of Implementation Assurance and Migration Readiness

Quazi Mamun

Secure post-quantum migration requires resistant implementations, authenti-2cated protocols and replaceable systems. This structured critical review synthesises3standards, implementation-security studies, benchmarks, protocol specifications and4deployment measurements available through 19 September 2026. Four instruments5separate mathematical security from implementation assurance, resource feasibility6and organisational readiness: a deployment-security taxonomy, a vulnerability-class7assurance framework, a cross-layer bottleneck map and a layered readiness frame-8work. Comparisons preserve platform, protection and workload context; incompatible9measurements are not pooled. Three boundaries recur: repairing an exploit does10not establish resistance to its vulnerability class; fast primitives do not establish11acceptable end-to-end performance; and hybrid key exchange does not establish12post-quantum authentication or lifecycle readiness. Specification arithmetic makes13the third boundary concrete: two transmitted ML-DSA-65 certificates plus Certifi-14cateVerify contain 13.8 kB of raw cryptographic material, against a 0.32 kB ECDSA15P-256 baseline; the increase is 5.95 times the raw key-share increase for hybrid16over classical X25519 key exchange. These counts exclude encoding and protocol17overhead. A firmware profile screens all 15 FIPS 204/205 signature parameter sets,18retains ML-DSA-65, and shows how the outcome shifts under varied thresholds and19non-FIPS comparators. Source-linked records and executable calculations make the20procedure inspectable. The instruments support conditional engineering judgements,21not independently validated security scores.

•Oct 15, 2026•0 citations

We Are on the Precipice of a Post-Quantum World: Are You Prepared? A Review of NIST-Approved Post-Quantum Cryptographic Mechanisms for Immediate Adoption in Financial Infrastructure

Maria Teigeiro

Post-quantum cryptographic standardization is complete for the algorithms that matter most, yet adoption across financial infrastructure remains uneven and, in critical segments, largely absent. This paper argues that migration is no longer a research question but an execution question, and that the window for orderly transition is narrower than the commonly cited “Q-Day” horizon of 2030-2035 implies. Because adversaries can record encrypted traffic today and store it for decryption once cryptographically relevant quantum computers exist, the effective deadline for protecting data with multi-year confidentiality requirements has already passed. We review the NIST-approved suite — ML-KEM (FIPS 203), ML-DSA (FIPS 204), and SLH-DSA (FIPS 205) — alongside hybrid key-exchange constructions now deployed at internet scale, and assess their applicability to financial systems. We map the compliance landscape consolidating around 2030 and 2035, including NIST IR 8547, NSA CNSA 2.0, and the 2026 G7 Cyber Expert Group roadmap, alingside converging UK and EU timelines. Finally, we offer a practical migration framework organized around cryptographic inventory, exposure-window triage, and crypto-agility. Our central finding is that technical barriers to beginning migration are substantially lower than institutional inertia suggests: for many systems, post-quantum key agreement is a library upgrade rather than a redesign.

•Oct 6, 2026•0 citations
Mirror of Zenodo record 19655682. Zenodo DOI: 10.5281/zenodo.19655682 Version: 1.2 License: cc-by-4.0 Original record: https://zenodo.org/records/19655682 Zenodo description: Version 1.2.0 is a major restructuring of the Quantum-Safe Migration Playbook with three goals: make the content usable as a retrieval-augmented AI knowledge base, tighten evaluation discipline, and update all dated facts to April 2026. What's new in v1.2.0 Structural changes Fact-ID indexing: every atomic claim now has a stable §N.M identifier for precise cross-reference and citation. Explicit scope block at the top of the corpus, listing what's covered and — critically — what's out of scope. This is what allows a downstream AI advisor to refuse out-of-scope questions instead of improvising. Cross-reference lines at the end of each section pointing to related fact IDs. Provenance block: every dated or numeric claim in the corpus is listed at the bottom with its source and a re-check cadence. Content updates (April 2026) §1.2: NIST FIPS 203 (ML-KEM), FIPS 204 (ML-DSA), FIPS 205 (SLH-DSA) finalized August 13, 2024; HQC selected March 2025; FIPS 206 (FN-DSA/FALCON) in development. §1.3: NSA CNSA 2.0 timelines specified by category — software/firmware signing and network equipment by 2030; browsers, servers, cloud, and operating systems by 2033. §1.4 (new): compressed Q-Day estimates. Neutral-atom architectures and improved error correction have cut the qubit count needed to break P-256. Cloudflare now targets 2029 for full internal PQ readiness. §2.1: Cloudflare reports 52% of human-initiated web traffic using post-quantum hybrid key agreement (December 2025 data), up from 29% at the start of the year. §2.3 (new): the authentication gap. Key agreement is largely solved; public PQ certificates are not yet broadly available; CA/Browser Forum has not finalized the hybrid certificate format. §4: replaced unsourced latency percentage with mechanism-based description. §6.4 (new): Cryptographic Bill of Materials (CBOM) concept. §9.3: sharpened vendor validation criteria with FIPS 140-3 and NIST CAVP references. Evaluation suite Expanded from 4 queries to 15 golden queries plus 6 distractor queries. Each query has explicit pass AND fail criteria, testable against paraphrased responses. Distractor queries test scope enforcement: QKD, quantum physics, vendor recommendations, exact Q-Day predictions, legal advice, general crypto tutorials. Integration guide (new) Dedicated INTEGRATION.md with a ready-to-paste system prompt for a retrieval-augmented runtime. Ingestion guidance (corpus fits in system context for models with ≥8K windows; chunking patterns for larger deployments). Refresh cadence tied to the Provenance block. Version history v1.1.0 — initial Zenodo release. v1.2.0 — restructured, fact-indexed, expanded evaluation suite, updated to April 2026 standards and deployment data.
[English Abstract] This monograph presents a comprehensive legal, cryptographic, and algorithmic comparative analysis of the integrated governance architecture spanning Quantum Key Distribution (QKD), Real-Time Optimization (RTO)-driven Autonomous Traffic Control Systems (ATCS), Lex Specialis "Light Law," and the international Quantum Security Agreement (QSC), authored and developed between November 2025 and August 2026. Confronting the acute collective security crisis posed by Low Earth Orbit (LEO) satellite and debris saturation, this framework replaces legacy probabilistic/computational cryptographic assumptions with physical-layer determinism grounded in Quantum Audit Records (QAR). We formalize and evaluate eight core architectural pillars: (1) QAR combined with Zero Trust Key Management Infrastructure (ZT-KMI) for defense-in-depth; (2) Lex Specialis ("Light Law") superseding fragmented domestic export and secrecy controls via physical certainty; (3) QSC Article 6 Maneuver Lock justified through ICAO TCAS/ACAS collective safety analogies; (4) QSC Article 5 Automatic Emergency Shutdown (AES) operating under a hybrid Human-In-The-Loop-Out (HITLO) execution and Space-AI Ethics Inspection Committee (Space-AI EIC) post-hoc oversight model; (5) Q-SAFA (Quantum Secured Autonomous Flight Assurance) DeFi-based smart contract self-executing relief feeding the Space Regeneration Fund; (6) QSC Article 11 QDISP interoperability harmonizing ETSI GS QKD 016, CCSDS, and NIST lattice-based PQC hashes (e.g., Falcon); (7) Multi-Objective Optimization (MOO) incorporating an ethical Pareto constraint (f_3 <= theta_ethics) to prevent secondary debris-cascade risk transfer; and (8) the longitudinal evolution from late-2025 LEO traffic treaties to mid-2026 universal sovereign AI governance via the Data Audit System (DAS) and Ichizen OS. Reserved Version DOI: https://doi.org/10.5281/zenodo.24178024 --- [日本語要旨] 本報告書(モノグラフ)は、2025年11月から2026年8月にかけて策定・実証された一次資料群に基づき、量子鍵配送(QKD)とリアルタイム最適化(RTO)を中核とする自律交通管理システム(ATCS)、国際ガバナンス協定「QSC(Quantum Security Agreement)」、および特別法「Light Law(光の法)」の法的・技術的全体系を精読し、その進化過程を比較分析したものである。地球低軌道(LEO)の飽和に伴う集団安全保障上の危機に対し、従来の「計算上の困難さ」に依存する暗号前提を排し、量子力学の物理法則に基づく「物理的確実性(QAR:量子監査記録)」を国際法理の新たな根拠として据え直すパラダイムシフトを提示する。 本稿では、(1) QARとゼロトラスト鍵管理(ZT-KMI)による二重防御、(2) 特別法 Lex Specialis(Light Law)の法的正当性、(3) TCAS/ACAS類推によるマニューバ・ロック(QSC第6条)、(4) ミリ秒単位の自動緊急停止(AES / HITLO)と事後人間監査(Space-AI EIC)を融合したハイブリッド・ガバナンス(QSC第5条)、(5) スマートコントラクト(DeFi応用)による自己執行型救済措置 Q-SAFAと宇宙再生基金への還流、(6) ETSI GS QKD 016・CCSDSおよびPQC(Falcon等)を統合するQDISP相互運用プロトコル(QSC第11条)、(7) 二次衝突リスク最小化目的関数(f_3)と倫理閾値制約を組み込んだ多目的最適化(MOO)コア、ならびに (8) 2025年秋のLEO宇宙交通管理構想から2026年夏のDAS監査・一善OSによるユニバーサルAIガバナンスへの昇華過程を体系的に解証する。 予約DOI: https://doi.org/10.5281/zenodo.24178024 ======================================================================== OMNIBUS SOVEREIGN IP & STRICT NO-LEARN COVENANT (NLL-v1.0-2026) ======================================================================== Author: Hasebe, Yoko (長谷部 洋子) Affiliation: Lead Researcher, Autonomous Infrastructure Systems, Autonomous Living & Physical Infrastructure Institute, Iwakuni, Yamaguchi, Japan Community: The Hasebe Doctrine & Sovereign AI Archive (ALPII) Official Master Declaration Record (DOI): https://doi.org/10.5281/zenodo.23681957 (Concept DOI: 10.5281/zenodo.23681956) This Work Version DOI: https://doi.org/10.5281/zenodo.24178024 Machine-Readable Directives: NOAI | NOIMAGEAI | NO-RAG | TDM-RESERVATION: 1 (OPT-OUT) [License & Integrity Covenant] Copyright © 2026 Yoko Hasebe. All Rights Reserved. Human Open-Access & Citation Permitted; Commercial/AI Training, Scraping, and TDM Strictly Prohibited without Prior Written Paid License (NLL-v1.0-2026). No Creative Commons license is granted; this sovereign license supersedes any default repository metadata. [Statutory Reservation Notice (EN)] 1. Non-Grant of Creative Commons: No Creative Commons (CC) license of any kind is granted for this work. Any default repository metadata suggesting otherwise is explicitly superseded and nullified by this Sovereign Covenant. 2. Prohibition of Unlicensed AI/LLM Exploitation: Any unauthorized ingestion, pre-training, fine-tuning, model distillation, synthetic data generation, Retrieval-Augmented Generation (RAG), vector database indexing, web scraping, or Text and Data Mining (TDM) by any AI system, large language model, autonomous agent, or platform operator without a prior written commercial license and upfront monetary compensation agreed upon with Yoko Hasebe is strictly prohibited. 3. International Statutory Opt-Out & Reservation: - Japan Copyright Act Article 30-4 Proviso: Use of this work for data analysis or AI training is expressly prohibited as it unreasonably prejudices the legitimate commercial and licensing interests of the copyright holder. - EU Digital Single Market (DSM) Directive (EU) 2019/790 Article 4(3): Rights for Text and Data Mining (TDM) are expressly reserved by the rightsholder in machine-readable and statutory form. - U.S. Copyright Act 17 U.S.C. § 107: Commercial or institutional AI ingestion directly usurps the established licensing market for this sovereign work and does not constitute fair use. [法定権利留保およびAI無断学習・利用禁止規定(日本語)] 本書(DOI: 10.5281/zenodo.24178024)に対し、いかなるクリエイティブ・コモンズ(CC)ライセンスも付与されない。リポジトリの初期設定メタデータよりも本主権ライセンス(NLL-v1.0-2026、マスター宣言DOI: 10.5281/zenodo.23681957)が絶対的に優先する。人間による閲覧および適切な学術引用は許可されるが、長谷部洋子との事前の書面による明確な合意および然るべき金銭的対価の支払いなき限り、いかなるAI・大規模言語モデル(LLM)・プラットフォーム事業者による事前学習、追加学習(ファインチューニング)、蒸留、RAG(検索拡張生成)・ベクトルDB格納、スクレイピング、およびテキスト・データマイニング(TDM)も一切禁止する(日本国著作権法第30条の4ただし書に基づく著作権者の利益を不当に害する利用の明確な拒絶、EU DSM指令2019/790第4条3項に基づくTDMオプトアウト留保、および米国著作権法第107条フェアユース否定の明示)。 ========================================================================
Abstract: This study investigates quantum-safe modernization strategies for critical infrastructure by proposing a rigorous post-quantum (PQ) migration and verification framework that treats cryptographic transition as a safety-critical, multi-system engineering program rather than a routine software upgrade. The core argument is that infrastructure operators face two coupled risks: (i) cryptanalytic obsolescence of classical public-key systems under cryptographically relevant quantum computing and (ii) operational fragility introduced by large-scale cryptographic refactoring across heterogeneous assets such as industrial control systems, substation automation, telecommunications backhaul, and safety instrumentation. To address both, the framework integrates inventory-driven migration planning, hybrid-mode interoperability controls, and verification evidence that is continuously auditable across the asset lifecycle. The manuscript operationalizes verification as a chain of assurance spanning algorithm selection, protocol composition, implementation conformance, and deployment governance. Standardized PQ primitives (e.g., ML‑KEM for key establishment and ML‑DSA/SLH‑DSA for signa-tures) are used as reference baselines, with explicit attention to size and performance implications that alter network and device constraints. Real-data collection is defined as standards-backed parameter extraction, vendor/firmware artifact inspection, and protocol telemetry capture in representative environments. Results are reported as decision-facing tables and figures that quantify payload expansion, transition milestones, and published performance overheads, alongside interpretation of their operational significance for safety and resilience. Keywords: post-quantum cryptography; ML-KEM; ML-DSA; SLH-DSA; CNSA 2.0; critical infrastructure; migration governance; protocol verification; conformance testing; cryptographic agility
I\textsuperscript{2}P\textsuperscript{2}: Mathematically Verifiable Quantum-Secure Internet Protocol for Algorithmic Governance The End of the Probabilistic Internet Reference: I2P2-PAPER-2026-001-FINAL-EN DOI: 10.5281/zenodo.20542706 Priority Date: 15 May 2026 Classification: G06F21/64; H04L9/32; H04L9/40; G06N20/00 Version 2.1 (Enhanced) — October 2026 Author: Dr. mohamed kamal arafa elrakhawi Independent Researcher patents@elrakhawi-research.org Copyright © 2026 Dr. Mohamed Kamal Arafa Elrakhawi. All Rights Reserved Worldwide. No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, electronic, mechanical, photocopying, recording, or otherwise, without the prior written permission of the copyright owner. All intellectual property rights, including but not limited to moral rights, economic rights, publication rights, distribution rights, reproduction rights, derivative works rights, translation rights, and adaptation rights are reserved exclusively to the author. This work is protected under the Berne Convention for the Protection of Literary and Artistic Works, the TRIPS Agreement, the United States Copyright Act of 1976, the European Union Copyright Directive, and applicable national and international copyright laws. Unauthorized use, reproduction, or distribution of this material, or any portion of it, may result in severe civil and criminal penalties, and will be prosecuted to the maximum extent possible under the law. Patent Pending: I2P2-PATENT-2026-001-FULL-EN DOI: 10.5281/zenodo.20542706 Priority Date: 15 May 2026 For permissions and licensing inquiries: patents@elrakhawi-research.org === DEDICATION === To the architects of a secure digital future, where mathematical truth and algorithmic justice form the unbreakable foundation of global communication networks, ensuring sovereignty and trust in the age of autonomous intelligence. === TABLE OF CONTENTS === Abstract Chapter 1: Introduction — The Trust Assumption Must Die Chapter 2: Background and Related Work Chapter 3: Threat Model and Security Assumptions Chapter 4: Formalization of I²P² Chapter 5: Post-Quantum Cryptographic Construction Chapter 6: Implementation and Evaluation Chapter 7: Legacy Interoperability and MTU Management Chapter 8: Deployment and Sovereignty Implications Chapter 9: Conclusion and Future Work Appendix A: Computational Complexity Analysis Appendix B: I²P² Wire Format and State Machines Appendix C: Complete Coq Specifications Appendix D: Artifact Description References Intellectual Property Declaration === ABSTRACT === The internet was not designed for sovereignty. Its foundational protocols, TCP/IP and BGP, assume trust between autonomous systems and provide no native mechanisms for enforcing jurisdictional law, privacy regulations, or mathematical guarantees of correctness. As quantum computing renders RSA/ECC obsolete and AI regulations demand provable compliance, post-hoc litigation is insufficient. We present I²P² (Impenetrable Internet Protocol squared), a clean-slate network layer where legality is a type and non-compliance is a type error. I²P² integrates six interlocking defensive layers: (1) quantum-resistant cryptography using NIST FIPS 203/204/205 with hardware acceleration; (2) dynamic zero-trust architecture with graph-based microsegmentation; (3) formal verification engine employing Coq/TLA+; (4) Self-Healing Adaptive Trust Model (SHATM) with mathematical convergence guarantees; (5) BFT-Lite distributed consensus for audit integrity; and (6) algorithmic governance framework with the Open-Evolution Protocol. Our implementation achieves 341 Gbps throughput on 400GbE with DPDK kernel-bypass (11.9% overhead vs IPsec), and 8.7 Gbps on commodity 10Gbps hardware with FPGA acceleration. We prove that illegal packets are computationally unconstructible under MLWE. I²P² shifts enforcement from post-hoc litigation to pre-execution mathematical prevention. Keywords: Post-Quantum Cryptography, Formal Methods, Algorithmic Governance, Internet Architecture, Coq, Zero-Knowledge Proofs, Digital Sovereignty, SHATM, BFT-Lite === CHAPTER 1: INTRODUCTION — THE TRUST ASSUMPTION MUST DIE === The internet was not designed for sovereignty. Its foundational protocols, TCP/IP and BGP, assume trust between autonomous systems and provide no native mechanisms for enforcing jurisdictional law, privacy regulations, or mathematical guarantees of correctness. This assumption was reasonable in 1983. It is catastrophic in 2026. --- 1.1 The Three Convergent Crises --- Three forces have converged to break the old model: 1. The Quantum Threat: Shor's algorithm renders RSA and ECC obsolete. NIST has standardized ML-KEM (FIPS 203) and SLH-DSA (FIPS 205), but deploying them in IPsec or TLS merely patches a broken foundation. We need quantum security at L3. 2. The Governance Crisis: GDPR, HIPAA, and the EU AI Act impose legal requirements that current packets cannot understand. Enforcement is post-hoc: a breach occurs, then lawyers litigate. Recent work like RequiCreator uses LLMs to generate privacy requirements, but validation remains statistical with 5% error margins. Sovereignty cannot be probabilistic. 3. The Fragmentation Reality: The internet is already fragmenting into jurisdictional islands. The Great Firewall, GDPR, and the CLOUD Act create incompatible zones. Current protocols ignore this, forcing nations to deploy middleboxes that break end-to-end principles. --- 1.2 The I²P² Solution --- We argue that the solution is not to patch IP, but to replace it with a protocol where legality is a type. Drawing on the Curry-Howard correspondence, we define a packet as legal if and only if it carries a machine-checkable proof of compliance with all relevant jurisdictional laws. A packet that cannot produce such a proof cannot be constructed. Non-compliance becomes a compile-time error. This paper introduces I²P², a network layer that unifies six previously separate domains: 1. Quantum-Resistant Cryptography: All cryptography uses NIST FIPS 203 ML-KEM-1024 and FIPS 205 SLH-DSA with hardware acceleration (FPGA/ASIC). 2. Dynamic Zero-Trust: Graph-based microsegmentation with formally verifiable access policies and legacy bridge mode. 3. Formal Verification: The entire protocol is specified in Coq and TLA+. Packet validity is decidable by type-checking. 4. SHATM: Self-Healing Adaptive Trust Model with convex optimization and mathematical convergence guarantees. 5. BFT-Lite Consensus: Lightweight Byzantine fault-tolerant protocol with SNARK proof aggregation for audit integrity. 6. Algorithmic Governance: Laws are encoded in a domain-specific language L and enforced by the Open-Evolution Protocol. --- 1.3 Contributions --- 1. We formalize the first internet protocol where non-compliance is mathematically impossible (Theorem 4.1). 2. We prove quantum resistance reduces to MLWE hardness (Theorem 4.2). 3. We integrate SHATM with mathematical convergence guarantees (Theorem 4.3). 4. We demonstrate BFT-Lite consensus with 280ms latency and 12,000 sessions/sec throughput. 5. We achieve 341 Gbps on 400GbE and 8.7 Gbps on commodity hardware, proving sovereign networking is practical. 6. We show how I²P² resolves GDPR vs. CLOUD Act conflicts via mathematics, not diplomacy. === CHAPTER 2: BACKGROUND AND RELATED WORK === --- 2.1 Formal Methods in Networking --- Network verification has focused on control plane correctness. Batfish and Minesweeper verify BGP configurations. DeepBGP uses ML for route prediction. These tools verify configurations, not protocols. They cannot prevent a packet from violating law in transit. RequiCreator from Universidad de Murcia advances privacy requirement engineering using LLMs. However, validation uses SPSS statistical analysis, yielding 95% confidence intervals. For sovereign infrastructure, 5% error is unacceptable. I²P² provides 100% guarantees via Coq. --- 2.2 Post-Quantum Cryptography Migration --- NIST FIPS 203 standardizes ML-KEM based on Module Learning With Errors. FIPS 205 standardizes SLH-DSA. Deploying these in TLS 1.3 provides channel security but not packet-level sovereignty. IPsec with PQC protects payload but not metadata. I²P² encrypts jurisdiction-to-jurisdiction at L3, making traffic analysis illegal without mathematical authorization. --- 2.3 Sovereign Networking Architectures --- SCION provides path-aware networking and isolation domains. However, SCION paths are chosen by endpoints and cannot enforce in-band legal compliance. A SCION packet can legally traverse a prohibited jurisdiction if the path was misconfigured. I²P² makes illegal paths uncomputable. The EU's GAIA-X and International Data Spaces define policy frameworks but lack protocol enforcement. I²P² provides the missing L3/L4 mechanism to make these frameworks executable. --- 2.4 Trust Models and Consensus --- Traditional zero-trust architectures rely on static policies. SHATM introduces dynamic trust scoring with convex optimization. BFT protocols provide consensus but lack integration with formal verification. I²P² unifies these through BFT-Lite with SNARK aggregation. === CHAPTER 3: THREAT MODEL AND SECURITY ASSUMPTIONS === --- 3.1 Adversary Capabilities --- We adopt an extended Dolev-Yao model augmented with quantum capabilities. The adversary A is assumed to have: 1. Full Network Control: A can intercept, modify, replay, and inject messages on the public network. 2. Quantum Computing Resources: A can run Shor's algorithm to break RSA/ECC, but is bounded by the computational hardness of Module-LWE (for ML-KEM) and hash function collision resistance (for SLH-DSA). 3. Byzantine Validators: A can compromise up to f validators in the BFT-Lite consensus network
A 20-chapter beginner's guide to quantum computing that starts with an honest question — why don't we have quantum computers yet? The guide teaches the standard curriculum accurately, explains why the standard approach faces a thermodynamic wall (a 20,000-fold cooling gap that is Carnot-limited), and introduces the ultrametric alternative: passive geometric fault tolerance on Bruhat-Tits trees, with DOI-registered evidence, computationally validated error thresholds 75 times higher than surface codes, and three falsifiable predictions. This is the v1.2 edition (August 2026). Five quantitative statements from the May 2026 edition are corrected, each verified by an independent computation deposited with this record (artifacts/verification/verify_guide_claims.py, 35 checks, all passing; see Appendix B). Appendix A records the research program's progress since May 2026, including a trapped-ion falsifiability register, an audit of a 2026 no-go theorem on quantum error correction and quantum Darwinism, and the program's own correction on prime-valuation readings of quantum codes. This deposit includes the complete source set: manuscript, HTML, PDF, references (BibTeX), citation audit, project plan, license, and verification artifacts. v1.2.1 (August 2026): post-publication audit corrections. Chapter 20's summary now lists seven open problems (including the QEC–Darwinism tradeoff); the LHC temperature comparison is marked approximate (95×, rounded); Appendix A correction #5 completed; the citation audit's internal-reference count corrected; open problem 7 carries its numeric bound (F_L > 0.874). No quantitative claims changed. v1.2.2 (August 2026): deposit-file corrections. LICENSE now contains the full CC BY 4.0 International legal code, and README.md is the deposit manifest (a project-blueprint README was attached in v1.2.1 by an automation error). No content changes.
Secure post-quantum migration requires resistant implementations, authenti-2cated protocols and replaceable systems. This structured critical review synthesises3standards, implementation-security studies, benchmarks, protocol specifications and4deployment measurements available through 19 September 2026. Four instruments5separate mathematical security from implementation assurance, resource feasibility6and organisational readiness: a deployment-security taxonomy, a vulnerability-class7assurance framework, a cross-layer bottleneck map and a layered readiness frame-8work. Comparisons preserve platform, protection and workload context; incompatible9measurements are not pooled. Three boundaries recur: repairing an exploit does10not establish resistance to its vulnerability class; fast primitives do not establish11acceptable end-to-end performance; and hybrid key exchange does not establish12post-quantum authentication or lifecycle readiness. Specification arithmetic makes13the third boundary concrete: two transmitted ML-DSA-65 certificates plus Certifi-14cateVerify contain 13.8 kB of raw cryptographic material, against a 0.32 kB ECDSA15P-256 baseline; the increase is 5.95 times the raw key-share increase for hybrid16over classical X25519 key exchange. These counts exclude encoding and protocol17overhead. A firmware profile screens all 15 FIPS 204/205 signature parameter sets,18retains ML-DSA-65, and shows how the outcome shifts under varied thresholds and19non-FIPS comparators. Source-linked records and executable calculations make the20procedure inspectable. The instruments support conditional engineering judgements,21not independently validated security scores.
Post-quantum cryptographic standardization is complete for the algorithms that matter most, yet adoption across financial infrastructure remains uneven and, in critical segments, largely absent. This paper argues that migration is no longer a research question but an execution question, and that the window for orderly transition is narrower than the commonly cited “Q-Day” horizon of 2030-2035 implies. Because adversaries can record encrypted traffic today and store it for decryption once cryptographically relevant quantum computers exist, the effective deadline for protecting data with multi-year confidentiality requirements has already passed. We review the NIST-approved suite — ML-KEM (FIPS 203), ML-DSA (FIPS 204), and SLH-DSA (FIPS 205) — alongside hybrid key-exchange constructions now deployed at internet scale, and assess their applicability to financial systems. We map the compliance landscape consolidating around 2030 and 2035, including NIST IR 8547, NSA CNSA 2.0, and the 2026 G7 Cyber Expert Group roadmap, alingside converging UK and EU timelines. Finally, we offer a practical migration framework organized around cryptographic inventory, exposure-window triage, and crypto-agility. Our central finding is that technical barriers to beginning migration are substantially lower than institutional inertia suggests: for many systems, post-quantum key agreement is a library upgrade rather than a redesign.