🔍 Read the full analysis: A New Map For Protecting Finance And Defence In The AI Age on ThorstenMeyerAI.com
Get the latest gadgets delivered free with Prime
- Fast, free delivery on millions of items
- Prime Video, Amazon Music and more included
- Member-only deals all year
TL;DR
OpenAI reported that an internal model produced 722 mathematical manuscripts, while researchers highlighted new algorithmic results and ongoing verification needs. Justin Drake and Vitalik Buterin have raised different concerns about cryptography, but no cryptographic system has been reported broken, and the implications for post-quantum standards remain unproven.
OpenAI’s October 6 release of 722 mathematical manuscripts produced by an internal AI model has renewed debate about whether advances in algorithm discovery could affect the assumptions behind cryptographic security. No cryptographic system has been reported broken; the concern, raised publicly by cryptocurrency figures Justin Drake and Vitalik Buterin, is that future algorithms could weaken schemes now treated as secure.
OpenAI said the manuscripts, grouped into 372 families, came from an unreleased internal model working on roughly 4,000 problems. The source account says generating each result used, on average, about three hours of ChatGPT Pro compute. The mathematical claims include work on the Unique Games Conjecture, Hilbert’s tenth problem over the rationals and a zero-free region for the Riemann zeta function. Those results remain claims requiring expert scrutiny, not settled mathematical findings.
Some of the results drawing attention concern computational complexity. Computer scientists Scott Aaronson discussed claimed improvements involving integer multiplication and Fourier transforms, while a separate result by Virginia Vassilevska Williams and Josh Alman gave a faster-than-expected algorithm for 3SUM. The source account says an Anthropic model contributed the key idea to that work. These developments do not themselves show that encryption has been defeated. They do, however, focus attention on longstanding assumptions about which computational problems are hard.
A day of checking also produced a correction: OpenAI withdrew a claimed proof concerning the Hodge conjecture for products of K3 surfaces, reportedly because of a sign error. The episode underlines the gap between producing mathematical material and verifying it. Scott Aaronson also noted that cryptography was absent from the 722 manuscripts. According to the source account, AI companies have begun discreetly testing whether internal models can attack important protocols, but it provides no specific test results or evidence of a successful break.
The old map is gone: AI mathematics, quantum computers and the cryptography holding up finance and defence
For a decade the plan was simple: elliptic curves doomed by quantum; lattices safe; hashes safe. Nothing has been broken. But a second threat has arrived that doesn’t respect those borders — AI producing new mathematics faster than any human community, against assumptions that are believed, not proven.
Now: on borrowed time — possibly shorter than the quantum countdown suggests.
Now: unproven against AI — and the destination most of the world is migrating to.
Now: reminded estimates move — BSI advised against new deployments on 1 Oct 2026.
Now: safest ground available — not a guarantee.
~n log0.9999999999999 n — a barrier many thought fundamental (OpenAI, claimed)
Overturns a half-century conjecture. Williams & Alman; key idea from an Anthropic model
“Conspicuous by its absence” (Aaronson) — labs reportedly testing crypto “gingerly and discreetly”
ECDSA could break before Q-day, “in the worst case in months not years.” Move funds to never-signed addresses. ~6M BTC sit behind exposed keys.
The new risk is the destination of the migration. Hash-only where possible; “much more paranoid” lattice params; ×10 key sizes long-term. Doesn’t recommend anyone scramble.
“No evidence whatsoever” that elliptic-curve assumptions are close to failing.
Classical breaks could reach “quantum-safe” schemes — but don’t treat a two-year scenario as a date.
Known to IBM and the NSA designing DES (~1974); public via Biham & Shamir (~1990); confirmed by Coppersmith (1994).
Invented at GCHQ — RSA- and Diffie–Hellman-equivalents — and kept secret for over two decades.
No crypto in 722 manuscripts. Found and withheld? Not posed? Posed and failed? Indistinguishable from outside.
Traffic recorded today is decrypted when a break arrives. For secrets that must last 25+ years, a break in 2035 is a break today. A state that finds one won’t announce it — it will mine its archives.
Signatures can be built from hashes. Encryption and key exchange need a trapdoor with structure — lattices, codes or group theory. Defence can only choose which structure, how much margin, how many combined.
Every date was set against quantum hardware forecasts with visible warning. The AI threat offers none.
“ML-KEM everywhere” means starting over if lattices weaken. “We can swap algorithms” doesn’t.
Blockchains show a classical break first — exposed keys and balances are public. Monitor dormant exposed addresses.
Every algorithm, key, certificate, protocol.
PQ + classical, as BSI requires.
Firmware, updates, long-term keys.
Highest sets; evaluate FrodoKEM.
More than one mathematical family; HQC coming.
Swap algorithms without rebuilding.
Forward secrecy, rotation, hidden keys.
Buterin: lost more in botched migrations than in all hacks.
Nothing has been broken, and the sceptics are right that there’s no evidence elliptic curves or lattices are about to fall. But the map has changed: elliptic curves on borrowed time, lattices unproven against AI, codes reminded that estimates move, hashes the safest ground available. For finance, intelligence and defence the answer is the same whichever threat arrives first.The quantum threat comes with a countdown. The AI threat may arrive as a silence — an empty folder where a paper should have been. The winners will be those who can change their algorithms fastest.
A Second Challenge to Crypto Planning
Governments, financial institutions and defence organisations have been preparing for a future quantum threat, particularly the risk that a sufficiently capable quantum computer could use Shor’s algorithm against RSA and elliptic-curve cryptography. The new concern differs: an improved algorithm could run on ordinary computers, and its discovery might not be visible to outsiders. Unlike quantum hardware progress, which can be followed through public research and engineering milestones, a privately held algorithm could remain secret.
That possibility matters because cryptographic security depends on assumptions about the difficulty of mathematical problems. A stronger algorithm might affect some systems more than others; it does not follow that every scheme would fail. The consequences would depend on what problem the algorithm solves, its practical performance and whether it applies to deployed protocols. For finance and defence, the uncertainty adds a question to migration planning: whether post-quantum replacements should be assessed only against quantum attacks or also against future advances in classical algorithm design.
quantum-resistant cryptography books
As an affiliate, we earn on qualifying purchases.
As an affiliate, we earn on qualifying purchases.
Quantum Migration Meets AI Research
International standards bodies have already formalised several post-quantum cryptographic options. In August 2024, the U.S. National Institute of Standards and Technology standardised ML-KEM for establishing encryption keys and ML-DSA for digital signatures, both based on lattices, alongside SLH-DSA, a hash-based signature standard. These standards are intended to address the expected capabilities of quantum computers; their existence does not establish how they would fare against a yet-undiscovered classical algorithm.
Public concern first surfaced prominently in cryptocurrency, where public keys and asset balances can be visible on blockchains. On October 7, Ethereum Foundation researcher Justin Drake urged the industry to plan calmly for a possible “bunker mode,” advising users to move funds to addresses whose public keys have not been exposed. His warning was a scenario, not evidence that ECDSA had failed. The source material estimates that about six million bitcoin are held at addresses with exposed public keys, but supplies no further methodology for that figure.
Ethereum co-founder Vitalik Buterin cautioned against rushing to move funds, while arguing that lattice-based systems could also merit scrutiny. His point was that advances in algorithms have historically changed estimates of how difficult some mathematical problems are. That is a reason to examine assumptions, not proof that current lattice standards contain a hidden weakness.
““IMO it is now reasonable to brace for the possibility that ECDSA breaks before qday, in the worst case in months not years.””
— Justin Drake, Ethereum Foundation researcher
post-quantum cryptography hardware security modules
As an affiliate, we earn on qualifying purchases.
As an affiliate, we earn on qualifying purchases.
No Cryptographic Break Reported
There is no reported successful attack on RSA, elliptic-curve cryptography, ML-KEM, ML-DSA or SLH-DSA in the supplied material. The mathematical manuscripts and algorithmic advances cited have not been shown to yield a practical attack on deployed cryptographic systems. It is also unclear what the AI companies’ reported internal testing has found; no protocols, results or timelines are identified.
Key technical questions remain open: whether any newly discovered algorithm would apply to cryptographic problems, how much faster it would be in practice, and whether the work could be independently reproduced. The source’s comparisons between quantum and AI risks are assessments, not established forecasts. In particular, the suggestion that hashes would be more resilient than lattice schemes is not demonstrated by the reported results.
As an affiliate, we earn on qualifying purchases.
Verification and Security Reviews
The immediate next step is independent review of the AI-generated mathematics and of any claimed algorithmic improvements. Cryptographers would need to establish whether a result applies to a specific security assumption and whether it can run at a scale that threatens real systems. Until such evidence emerges, Drake’s migration advice and Buterin’s cautions remain distinct risk-management views, not proof of an active compromise.
For institutions already planning post-quantum migration, the development points to continued review of standards and implementation choices alongside quantum-readiness work. The supplied material does not identify a government directive, revised migration deadline or change to NIST’s standards. Further public evidence—reproducible results, technical analysis or disclosures from AI companies—will determine whether this concern changes from a theoretical warning into a practical security issue.
cryptography research reference guides
As an affiliate, we earn on qualifying purchases.
As an affiliate, we earn on qualifying purchases.
Key Questions
Has an AI system broken a cryptographic scheme?
No such break is reported in the supplied material. The concern is that AI-assisted mathematical research could lead to algorithms that weaken some cryptographic assumptions.
What did OpenAI report on October 6?
OpenAI published 722 mathematical manuscripts in 372 families, attributed to an unreleased internal model. The claims are still subject to checking, and at least one proof claim was withdrawn after an error was identified.
A quantum attack on RSA and elliptic-curve systems would require a sufficiently capable quantum computer. The concern discussed here is that a better algorithm could run on ordinary computers and might be developed or kept private without a visible hardware countdown.
Should cryptocurrency holders move their funds now?
The cited comments do not establish a need for an immediate mass move. Drake recommended planning for addresses with unexposed public keys; Buterin said he did not recommend that users scramble to move funds immediately.
Are post-quantum cryptography standards confirmed to be vulnerable?
No vulnerability is confirmed in the source material. The discussion raises questions about assumptions behind lattice-based schemes, but does not show that ML-KEM or ML-DSA can be practically attacked.
Source: ThorstenMeyerAI.com
Halloween Picks
halloween
As an affiliate, we earn on qualifying purchases.
