This addendum provides targeted technical extensions and mathematical clarifications to themain monograph “Deterministic Spectral Manifold for Post-Quantum Cryptography” (ResearchGate, 2026) without altering its core structural results. Five core claims are updated with June 2026 technical precision to support rigorous intellectual property auditing. Section 1 formalizes the UMetric (arithmetic firewall) and corrects the characterization of ε0 = |δ| = 1/24 as a configurable system sensitivity parameter rather than an absolute topological lower bound. Section 2 evaluates the 220-dimensional protected subspace: the nf −nb = 220 mode count is explicitly reconciled, and the Grover security level is constrained to 2110, identifying the precise structural adjustments required for absolute NIST Level 1 compliance. Section 3 reframes the 72-phase entropy harvester, demonstrating that the structural δ = −1/24 defect bounds the deterministic grid while physical thermal jitter across boundary transitions provides the true randomness. Section 4 replaces the probabilistic “zero-knowledge” framing with a mathematically rigorous “computationally private projection”protocol. Section 5 scales back the side-channel evaluation from “immune” to “reduced attack surface,” detailing the benefits of fixed-N computational metrics. All extensions derive directly from the rigid DSM-861 baseline: Heegner discriminant D = −163, projection matrix P, and the 72-fold synchronization clock.
This addendum provides targeted technical extensions and mathematical clarifications to themain monograph “Deterministic Spectral Manifold for Post-Quantum Cryptography” (ResearchGate, 2026) without altering its core structural results. Five core claims are updated with June 2026 technical precision to support rigorous intellectual property auditing. Section 1 formalizes the UMetric (arithmetic firewall) and corrects the characterization of ε0 = |δ| = 1/24 as a configurable system sensitivity parameter rather than an absolute topological lower bound. Section 2 evaluates the 220-dimensional protected subspace: the nf −nb = 220 mode count is explicitly reconciled, and the Grover security level is constrained to 2110, identifying the precise structural adjustments required for absolute NIST Level 1 compliance. Section 3 reframes the 72-phase entropy harvester, demonstrating that the structural δ = −1/24 defect bounds the deterministic grid while physical thermal jitter across boundary transitions provides the true randomness. Section 4 replaces the probabilistic “zero-knowledge” framing with a mathematically rigorous “computationally private projection”protocol. Section 5 scales back the side-channel evaluation from “immune” to “reduced attack surface,” detailing the benefits of fixed-N computational metrics. All extensions derive directly from the rigid DSM-861 baseline: Heegner discriminant D = −163, projection matrix P, and the 72-fold synchronization clock.
The advent of Cryptographically Relevant Quantum Computers (CRQCs) presents an existential threat to classical public-key infrastructure, particularly through ”Harvest Now, Decrypt Later” (HNDL) data collection vectors. Conventional Post-Quantum Cryptogra- phy (PQC) deployments often rely on heuristic software adaptations that lack fundamental physical security bounds, remaining vulnerable to side-channel leakage, packet fragmen- tation, and temporal desynchronization. In this paper, we establish a highest-baseline Quantum Security Architecture fully compliant with NIST Category 5 and NSA CNSA 2.0 standards. Grounded in pure first-principles physics, we derive a holographic entropy bound (Sholo ≤ A/4lP2 ) to govern Quantum Random Number Generators (QRNG), guar- anteeing uniform entropy output (Hout = 1.0000 bit/bit). We integrate a Triple-Hybrid Key Exchange engine featuring ML-KEM-1024, ML-DSA-87, and SLH-DSA-256s alongside a novel Modular Relational Time metric (dτ) that decouples key lifetimes from classical clock coordinates, thereby neutralizing HNDL vectors at the structural layer. Furthermore, by employing a Constrained Jacobian Projection Covariance Matrix and enforcing acous- tic stability conditions (c2s > 0), our architecture maintains strict constant-time execution and suppresses total propagated error margins to sub-permil levels (σtotal ≈ 0.28%). De- tailed comparative benchmarks, side-channel attack analyses, and enterprise deployment case studies demonstrate absolute resilience across critical data center infrastructures.
This paper is the third member of a three-paper series on post-quantum cryptography for African financial institutions, alongside Post-Quantum Migration Readiness for African Finance (Paper 1) and A Crypto-Agile Post-Quantum Architecture for Banking (Paper 2). Paper 1 asks whether and how African financial institutions should begin migrating to post-quantum cryptography; Paper 2 asks where post-quantum cryptography belongs inside a bank's own systems. This paper asks what the research team studied, built, and tested to reach the positions Paper 1 and Paper 2 take, and what mathematics and mechanics sit underneath them. It is written as a technical narrative rather than a formal specification. The account starts with the quantum-mechanical foundations of the work (qubits, superposition, entanglement, the gate model of computation) and the phase-estimation and Hamiltonian-simulation ideas that go beyond the team's own circuits. It then covers the mathematics of the quantum threat, with Shor's and Grover's algorithms worked against concrete RSA-2048 and secp256k1 parameters, and the mathematics of the post-quantum replacements: Module-LWE, Module-SIS, and the ML-KEM and ML-DSA constructions built on them. It also explains why NIST has standardized SLH-DSA and is standardizing HQC and FN-DSA alongside them. From there the document turns to the hybrid cryptography mechanism that Paper 2's architecture assumes, a zero-knowledge compliance layer built on STARKs rather than discrete-logarithm proofs, and the team's own validation of quantum circuits on real IBM quantum hardware, reported with the job identifiers and measured data those runs produced. It does not duplicate either paper. It documents the research and experimentation underneath both, at a technical depth that neither paper's narrative form carries. The series follows a zero-fabrication discipline, and this paper does too. Every mathematical claim traces to a cited primary source or to one of two companion technical documents produced during this research (a mathematical-foundations reference and a STARK-integration architecture report), and every experimental claim traces to a specific, named quantum-hardware job. Nothing is presented as executed that was not run. The one area with no hands-on execution, Google's quantum-computing platform, is covered from published literature only and is marked as such.
This note species the hardware realization of the DSM-861 deterministic computing architecture, in which correctness is enforced by geometry rather than by error correction. The processor confines computation to a protected subspace of an 861-node spectral manifold through a passive projection operator; states that leave the admissible subspace are shunted before output.Three properties are guarantees, established as theorems of the architecture: exact connement by idempotency (P2 = P, zero leakage); bounded perturbative leakage through the spectralgap rewall (∥(I − P)δx∥ ≤ ∥V ∥/∆); and monotone convergence of the associative memory to a stored attractor. The remaining specicationsnode count, clock structure, arithmetic anchoring, and spline orderare xed by the arithmetic of the terminal Heegner discriminantD = −163. Performance claims are scoped to what the architecture supports: the chip is a classical deterministic device whose projection and associative dynamics are quantum-like in form,and its suppression of inadmissible outputs is exact for the class of states whose inadmissibility is detectable by the 861-projection.
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.
We present a complete cryptographic trapdoor primitive constructed by embeddingKolmogorov–Arnold Networks (KAN) with Dense Associative Memory (DAM) layersonto the DSM-861 Deterministic Spectral Manifold — a rigid triangular-lattice 3-toruswith exactly N = 861 nodes, 72-fold gear-lock symmetry, topological defect δ = -1/24,and intrinsic Casimir residue |ε| = 1/12 (derived via Euler-Maclaurin regularization ofδ). The private key is an exact initial spectral signature ψ0. Forward trapdoor evaluation (private key → public key) is an exact algebraic spectral mapping of the Kolmogorov–Arnold decomposition executed via discrete Lax pairs satisfying the zero-curvature condition [∂/∂t − A, L] = 0. The Dense Associative Memory layerresolves superpositions deterministically. Inversion is rendered computationallyintractable by the non-periodic, non-Abelian geometry of the closed manifold,topological phase locking, and intrinsic Casimir stabilization. This constructiondelivers deterministic, drift-free signature generation and verification with zeroprobabilistic failure. We provide full mathematical definitions, explicit constructions,rigorous security reductions, quantitative resource comparisons with Babbush et al.(2026), implementation considerations, and integration with intrinsic topologicalquantum error correction. The primitive offers a practical, quantum-resistantalternative to lattice-based post-quantum cryptography with dramatically reducedoverhead and no reliance on heuristic hardness assumptions.
This sixth volume of the anatomical critique systematically deconstructs the purely mathematical paradigm of lattice-based post-quantum cryptography (PQC), proposing that cryptographic security in the quantum era is fundamentally a thermodynamic property of information systems. The work validates this 'transient bottleneck thesis' through comprehensive empirical quantum simulations of Learning with Errors (LWE) extraction on 2026-era Mamun, SM (2026) ………………………………………….1 Theoretical and Physical Boundaries of Lattice-Based Post-Quantum Cryptography: An Anatomical Critique of Empirical Quantum Simulation on NISQ and Analog Devices (Vol-VI) K S C Noisy Intermediate-Scale Quantum (NISQ) gate-based processors (IBM, IonQ, Rigetti), neutral-atom analog platforms (QuEra), and photonic continuous-variable systems. Empirical results confirm that standard Gaussian LWE is protected against heuristic Variational Quantum Algorithm (VQA) attacks by the exponential thermodynamic overhead required for deep circuit transpilation and error mitigation. However, experiments on analog and photonic hardware physically prove the structural equivalence between LWE noise and continuous-variable displacement errors, confirming that Gottesman-Kitaev-Preskill (GKP) error correction can function as a physical decryption mechanism. Also available on Academia.edu: https://www.academia.edu/attachments/132771797/download_file?s=portfolio