🔍 Read the full analysis: What Is Changing In The Cryptography That Supports Finance And Defence? on ThorstenMeyerAI.com
Get smart everyday buys 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 producing 722 mathematical manuscripts with an internal model, including results that challenge some beliefs about computational complexity. Cryptographers and cryptocurrency figures say the work highlights a possible second risk to cryptographic systems, but no major protocol has been shown to be broken, and the implications for post-quantum standards remain uncertain.
OpenAI reported that an unreleased model produced 722 mathematical manuscripts from about 4,000 problems, prompting warnings from researchers and cryptocurrency figures that algorithmic advances could challenge cryptographic systems, including some designed to withstand quantum computers. The work has not demonstrated a break of any major cryptographic protocol, but the debate matters to banks, governments and defence agencies planning systems that may need to remain secure for decades.
The manuscripts, published on October 6, were generated by an unreleased OpenAI model from about 4,000 problems, according to the source account. The results were grouped into 372 families. Among the claims were work on the Unique Games Conjecture, Hilbert’s tenth problem over the rationals and a zero-free region for the Riemann zeta function. These are mathematical claims under review, not established results merely because they were published.
The cryptography discussion centers less on famous conjectures than on claims about faster computation. Computer scientist Scott Aaronson catalogued reported results involving integer multiplication and the Fourier transform below the commonly expected n log n time, and a result for 3SUM with running time around n^1.9992. The source says the 3SUM result appeared in a paper by Virginia Vassilevska Williams and Josh Alman, with a key idea attributed to an Anthropic model. These findings concern algorithmic complexity; they do not by themselves show that encryption can be broken.
A correction has also underscored the need for scrutiny: OpenAI withdrew a claimed proof concerning the Hodge conjecture for products of K3 surfaces after a reported sign error. Aaronson said cryptography was conspicuously absent from the 722 manuscripts and that his sources reported AI companies were discreetly testing models against important protocols. That testing claim is not independently detailed in the supplied material, and no successful protocol break is reported.
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.
Why Algorithmic Advances Matter
Modern cryptography depends on mathematical problems that are believed to be computationally difficult, rather than on a proof that no efficient solution can ever exist. If a new algorithm substantially reduces the cost of solving one of those problems, systems may become vulnerable even when their underlying mathematics has not changed. That possibility affects digital signatures, secure communications and key exchange used across finance and national security.
The concern differs from the established quantum-computing threat. A sufficiently capable quantum computer running Shor’s algorithm could undermine RSA and elliptic-curve cryptography. Progress toward such hardware can be tracked through public research and engineering milestones. A classical algorithm discovered by an AI system might require no new specialized hardware, and its discovery could remain secret. This creates a harder planning problem for organizations that cannot know whether a competitor or state has found a useful method.
The practical risk is not confirmed to be imminent. The reports describe mathematical work and warnings, not evidence that financial transactions, military communications or deployed encryption have been compromised. Still, decision-makers must weigh the possibility that cryptographic assumptions could weaken while migration programs are underway. That makes independent verification and careful contingency planning relevant, without treating speculative warnings as proof of a current breach.
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
Governments and industry have been preparing for the possibility that future quantum computers could break widely used public-key systems. In August 2024, the US National Institute of Standards and Technology standardized three post-quantum tools: ML-KEM for establishing encryption keys, ML-DSA for digital signatures, and SLH-DSA, a hash-based signature standard. Organizations are beginning the long work of assessing and replacing vulnerable systems.
The source account frames the new concern as a challenge to the assumption that lattice-based standards are safe from advances in ordinary, or classical, computing. That is a possibility being raised, not a finding that the standards have failed. The account also describes hashes as likely to remain comparatively robust, but provides no settled assessment that would establish the safety of any specific deployment.
Public-key exposure makes cryptocurrency a visible part of the discussion. On October 7, Ethereum Foundation researcher Justin Drake urged the industry to plan calmly for what he called “bunker mode,” including moving funds to addresses whose public keys have not been exposed. The source estimates that roughly six million bitcoin are held at addresses with exposed public keys. That figure is attributed to the supplied account and does not mean those funds are currently vulnerable to a demonstrated attack.
“calmly begin planning for ‘bunker mode'”
— Justin Drake, Ethereum Foundation researcher
As an affiliate, we earn on qualifying purchases.
What the Mathematics Has Not Shown
No cryptographic protocol is reported broken in the supplied material. The OpenAI manuscripts require checking, and at least one claimed result was withdrawn after an error was identified. It is not clear how many of the remaining results will survive independent review or whether any would translate into a practical attack on deployed cryptography.
The account does not provide technical details of the reported private testing by AI companies, identify protocols tested, or confirm that any test succeeded. It also gives no evidence that AI systems can reliably discover cryptographic attacks at scale. Buterin’s concerns about lattices are warnings about possible mathematical weaknesses, not proof of one. The timing, feasibility and likely cost of any attack remain unknown.
As an affiliate, we earn on qualifying purchases.
Verification and Migration Decisions
The immediate next step is independent checking of the mathematical claims, including whether the reported algorithms are correct, reproducible and relevant to cryptographic problems. Researchers and standards bodies would need to assess any validated result against specific implementations before drawing conclusions about security.
Financial institutions, defence organizations and government agencies will continue evaluating post-quantum migration, while monitoring both quantum hardware and developments in classical algorithms. The supplied source gives no timetable for a standards change or an official government response to the AI work. For cryptocurrency users, Drake and Buterin’s contrasting comments show that public advice remains divided: planning for possible exposure is not the same as an instruction to move funds immediately.
As an affiliate, we earn on qualifying purchases.
Key Questions
Has AI broken RSA, elliptic-curve cryptography or a post-quantum standard?
No break is reported in the source material. The mathematical manuscripts and warnings have not been shown to yield a practical attack on a deployed protocol.
How is the possible AI threat different from quantum computing?
A sufficiently capable quantum computer could use Shor’s algorithm against RSA and elliptic-curve systems. The AI-related concern is that a model might help discover a faster algorithm that runs on ordinary computers; whether that can happen in a practically damaging way is unknown.
Are post-quantum standards such as ML-DSA known to be unsafe?
No. The source describes concerns about assumptions behind lattice-based systems, not a demonstrated flaw in ML-DSA or a finding that NIST’s standards are unsafe.
Should cryptocurrency holders move their funds now?
The supplied account reports differing views. Justin Drake urged planning for “bunker mode,” while Vitalik Buterin said he did not recommend scrambling to move funds immediately. Neither statement is evidence of a current protocol break.
What needs to happen before the warnings change security policy?
Researchers would need to verify the claimed mathematics and show whether it applies to specific cryptographic systems. Standards bodies and organizations would then need to evaluate the practical impact, including attack costs and implementation details.
Source: ThorstenMeyerAI.com
Halloween Picks
halloween
As an affiliate, we earn on qualifying purchases.
