This review conducts an anatomical reading of Grover, Haile, Pedersen, Uner and Erickson (2026), A Scenario-Based Evaluation of CRQC+AI Vulnerability Spectrum for TLS 1.3 Cryptographic Dependencies. The source paper does not claim a known break of any NIST-standardised post-quantum primitive. Its distinctive contribution is an evidence-tiered, parameterised, and explicitly revisable estimation instrument that separates mechanism-backed risk (Shor against RSA and elliptic-curve schemes) from contingency-backed lattice risk (an unproven effective-dimension collapse parameter ρ) and hypothesis-only risk to hash-based and symmetric primitives. The present review reconstructs the three coupled instruments (engineering-channel model, capability model, cryptanalytic cost model), enumerates strengths and weaknesses, and situates the work against ten competing families of quantum-threat modelling: Mosca–Global Risk Institute expert elicitation; Gidney-class resource estimation; NIST IR 8547 policy calendars; NSA CNSA 2.0 mandates; vendor hardware roadmaps; core-SVP / BKZ lattice costing; NIST MAXDEPTH Grover accounting; Gershteyn–Alber Quantum Horizon Monte Carlo; single-point Q-Day / Y2Q countdowns; and Rose's-Law hardware envelopes. Ontologically, the paper shifts the object of forecasting from a unique Q-Day event to a graded spectrum of primitive-erosion states. Also available on Academia.edu: https://www.academia.edu/attachments/134024130/download_file?s=portfolio
This review conducts an anatomical reading of Grover, Haile, Pedersen, Uner and Erickson (2026), A Scenario-Based Evaluation of CRQC+AI Vulnerability Spectrum for TLS 1.3 Cryptographic Dependencies. The source paper does not claim a known break of any NIST-standardised post-quantum primitive. Its distinctive contribution is an evidence-tiered, parameterised, and explicitly revisable estimation instrument that separates mechanism-backed risk (Shor against RSA and elliptic-curve schemes) from contingency-backed lattice risk (an unproven effective-dimension collapse parameter ρ) and hypothesis-only risk to hash-based and symmetric primitives. The present review reconstructs the three coupled instruments (engineering-channel model, capability model, cryptanalytic cost model), enumerates strengths and weaknesses, and situates the work against ten competing families of quantum-threat modelling: Mosca–Global Risk Institute expert elicitation; Gidney-class resource estimation; NIST IR 8547 policy calendars; NSA CNSA 2.0 mandates; vendor hardware roadmaps; core-SVP / BKZ lattice costing; NIST MAXDEPTH Grover accounting; Gershteyn–Alber Quantum Horizon Monte Carlo; single-point Q-Day / Y2Q countdowns; and Rose's-Law hardware envelopes. Ontologically, the paper shifts the object of forecasting from a unique Q-Day event to a graded spectrum of primitive-erosion states. Also available on Academia.edu: https://www.academia.edu/attachments/134024130/download_file?s=portfolio
This paper evaluates quantum and AI-accelerated risks to TLS 1.3 cryptographic dependencies under an evidence-tiered model, distinguishing mechanism-backed threats (Shor algorithm against RSA and ECC) from contingency-backed risks to lattice-based post-quantum cryptography (PQC) and hypothesis-only risks to hash-based and symmetric primitives. We do not identify any known breaks of ML-KEM, ML-DSA, SLH-DSA, or AES-256. Instead, we use explicit scenario assumptions, organized as a four-scenario capability model with parameters and pseudocode for reproducibility, to stress-test migration timelines accompanied by parameter sensitivity analysis and explicit falsification analysis. The primary methodological contribution is a reproducible scenario-estimation instrument together with its explicit update mechanics: every parameter is a named, anchored quantity that can be varied and the model rerun; a stated protocol maps observed conformance to, or deviation from, the modeled curves onto revisions of specific parameters, so progressive refinements can be tested against accumulating historical data. The paper is a methodological companion to quantum resource-estimation studies and to expert-elicitation timeline surveys such as the Global Risk Institute quantum threat reports, with its revision rules stated explicitly. As of mid-2026, the model does not show any NIST-approved algorithms as broken. Instead, the vulnerability spectrum under different scenarios shows RSA risk crossing the 50% threshold between 2030-2032 and the PQC risk becoming a non-zero risk after 2032-2035 under contingency scenarios conditional on the unproven dimension-collapse. We urge PQC migration as mandatory per the 2030 and 2031 federal deadlines and by Mosca HNDL reasoning, and that crypto-agility and hybrid cryptographic deployment be considered necessary complements to any PQC migration efforts.
This seventh volume of the series establishes the first formal post-post-quantum taxonomy—a three-tier ontological and epistemological hierarchy that reclassifies all post-quantum cryptographic schemes according to the fundamental nature and justification of their security. The hierarchy progresses from computational (algorithmic hardness assumptions) through physical (thermodynamic, noise-engineered, and hardware-constrained irreversibility) to device-independent (information-theoretic guarantees independent of device implementation). Building directly upon the anatomical critiques, hybrid primitives (Vol II), QRAM-hardness (Vol III), parameterized adversary models (Vol IV), GKP-resistant countermeasures (Vol V), and NISQ empirical validation (Vol VI), we provide a complete reclassification of NIST PQC standards, hybrid protocols, and the novel primitives introduced across the series. Dedicated Mamun, SM (2026) ……………………………….1 Theoretical and Physical Boundaries of Lattice-Based Post-Quantum Cryptography: An Anatomical Critique of Post-Post-Quantum Taxonomy (Vol-VII) sections dissect the ontology (what security is) and epistemology (how security claims are known and justified) of each tier. K S C The taxonomy reveals that current lattice-based schemes remain anchored in the provisional computational tier, while the countermeasures developed in Vols III–VI elevate them into the physical tier. True device-independent security remains an aspirational frontier. Also available on Academia.edu: https://www.academia.edu/attachments/132771868/download_file?s=portfolio
This anatomical review dissects Maria Singh's LinkedIn Pulse article 'Q-Day Is the Wrong Question: The Real Challenge Is Cryptographic Adaptation' (7 June 2026), a practitioner-oriented intervention within the Red Queen Signal series. The paper reframes quantum cybersecurity discourse from speculative timeline prediction ('When will Q-Day arrive?') to organizational readiness and cryptographic agility. Employing historical analogies (Y2K remediation, SHA-1 deprecation) and the 'Harvest Now, Decrypt Later' (HNDL) threat model, Singh advances 'adaptation velocity' as the decisive security metric in a Red Queen environment of perpetual technological disequilibrium. This review evaluates the argument's structural integrity, rhetorical efficacy, and evidential foundations; contrasts it with leading global frameworks from NIST (NCCoE Migration Project, CSWP 39), ENISA, ETSI, NSA CNSA 2.0, and recent academic literature on PQC migration and crypto-agility; and excavates its deeper epistemological and ontological implications. While the article offers a timely strategic pivot accessible to enterprise leadership, it under-engages technical migration complexities, quantitative models, and equity dimensions critical for Global South contexts. As Volume I of the KSCCN series, this review establishes the foundational reframing; subsequent volumes will operationalize metrics, case studies, and integrative governance frameworks at the quantum-AI nexus. 1. Also available on Academia.edu: https://www.academia.edu/attachments/133038100/download_file?s=portfolio
This review provides a detailed anatomical dissection of Jung et al. (2026), a recent preprint that challenges the prevailing classification of lattice-based cryptography—particularly the Learning with Errors (LWE) paradigm—as unconditionally "post-quantum." The paper systematically interrogates LWE across computational complexity, information-theoretic thermodynamics, quantum error correction (QEC), and quantum learning theory, arguing that its security rests on transient physical and engineering bottlenecks rather than fundamental theoretical barriers. We evaluate the paper's structure, strengths, and limitations; situate its claims within at least ten competing models and theories in post-quantum cryptography (PQC); examine the ontological (nature of cryptographic security) and epistemological (justification KSCCN Mamun, SM (2026)…………………………………1 Theoretical and Physical Boundaries of Lattice-Based Post-Quantum Cryptography: An Anatomical Critique of Noise-Reliant Security in the Quantum Era (Vol-I) of security claims) dimensions of its central themes; and propose extensions and ideation pathways. While the work offers a provocative interdisciplinary synthesis, its conclusions remain largely speculative and do not constitute a practical break of standardized schemes. Nonetheless, it underscores critical gaps in the long-term robustness of noise-dependent PQC. Also available on Academia.edu: https://www.academia.edu/attachments/132758388/download_file?s=portfolio
Introduction Estimates of the quantum resources required to break public-key cryptography fell sharply across 2025 and 2026, by enough to disturb the assumptions underlying the timing models organizations use to plan cryptographic migration. This review synthesizes published estimates for breaking RSA-2048, an integer-factoring target, and 256-bit elliptic-curve cryptography, a discrete-logarithm target, and examines what the revised figures do and do not imply for Mosca’s inequality, the standard risk-timing framework. Methods Following a protocol adapted from PRISMA 2020 conventions for a technical corpus, and after a search conducted in two rounds, 84 sources were included from preprint servers, standards repositories, and peer-reviewed venues, with 13 core studies charted in a structured extraction matrix of twelve fields that records the assumption set behind every physical-qubit figure. Results The headline physical-qubit estimate for factoring RSA-2048 fell from about one billion in 2012 to 20 million in 2019, to roughly 900,000 in 2025, and to figures between about 11,000 and 471,000 in 2026 depending on the operating point selected. Estimates for 256-bit elliptic-curve keys followed a comparable path. The reductions are attributable to arithmetic and circuit innovations, magic-state techniques, higher-rate quantum error-correcting codes, and changed architectural and hardware assumptions, and these contributions are decomposed separately here instead of being reported as a single trend. A synthesis restricted to peer-reviewed sources alone yields the same direction of travel but a materially weaker magnitude, and this is reported explicitly. Discussion A reduction in required qubits compresses a resource threshold, not a calendar. Because the relationship between a resource requirement and the date a machine meeting it is built depends on fabrication yield, achieved error rates, connectivity, decoder throughput, control systems, and sustained-runtime engineering, this review presents the consequences for Mosca’s inequality as conditional implications and supports them with scenario analysis across plausible confidentiality lifetimes, migration times, and threat horizons in place of a point forecast. The evidence reduces one barrier to feasibility and widens the uncertainty around the threat horizon; on a risk-management basis, not an evidentiary one, that combination favors prioritized migration of long-lived confidential data.
Quantum computing poses a real, broad-based, but bounded and substantially mitigable threat to Bitcoin and Ethereum. We separate the two quantum algorithms that public discussion routinely conflates: Shor's algorithm breaks the elliptic-curve signatures (ECDSA over secp256k1, BLS over BLS12-381) that authorize spending, whereas Grover's algorithm does not meaningfully threaten proof-of-work mining, which is protected by a merely quadratic speedup, fault-tolerant per-operation costs, a square-root parallelization wall, and difficulty adjustment. Folding hardware scaling, the falling resource requirement, a fault-tolerance readiness lag, and expert surveys into a single Monte-Carlo forecast yields a wide, bimodal arrival distribution for a cryptographically relevant quantum computer: about a one-in-six chance by 2035, near 30% by 2040, and about 60% by 2050. Exposure is concentrated and mostly migratable: of Bitcoin's roughly six million quantum-exposed coins only about 2.3 million are irreducibly at risk, while 50 to 65% of Ether sits at key-revealed accounts that can adopt post-quantum signatures. A timely migration beats even an optimistic 2035 machine, so the binding constraint is governance, not technology. A survey of the top twenty cryptocurrencies finds none fully post-quantum. Reproducible models accompany every quantitative claim.