🔍 Read the full analysis: Finance And Defence Face Changing Demands For Digital Security on ThorstenMeyerAI.com
Get business pricing on monitors, keyboards and dev gear
- Business-only prices and quantity discounts
- Tax-exempt purchasing
- Multiple users, one account, clear invoices
TL;DR
OpenAI published 722 mathematical manuscripts produced with an internal AI model, including results involving computational complexity; the claims remain subject to verification. Researchers have warned that AI-assisted mathematical advances could challenge assumptions behind cryptography, adding uncertainty to security planning already shaped by quantum computing. No cryptographic system has been reported broken in the source material.
OpenAI said the manuscripts came from roughly **4,000 problems** and were organized into 372 families. The source says the model used, on average, about three hours of ChatGPT Pro compute per result. Among the reported claims are results concerning the **Unique Games Conjecture**, Hilbert’s tenth problem over the rationals and a zero-free region for the Riemann zeta function. These are presented as claims, not settled mathematical results.
For cryptographers, the most relevant reports concern computational complexity. Computer scientist Scott Aaronson highlighted claims involving integer multiplication and the Fourier transform taking less than n log n time, as well as a result placing 3SUM at about **n^1.9992 time**. The source attributes the 3SUM work to a paper by Virginia Vassilevska Williams and Josh Alman, published the day before OpenAI’s release, and says an Anthropic model supplied the key idea. The results challenge longstanding expectations about how efficiently some problems can be solved, but do not by themselves show that deployed encryption can be defeated.
The source also reports that OpenAI withdrew a claimed proof concerning the Hodge conjecture for products of K3 surfaces after a sign error was identified. That correction underscores the difference between producing a mathematical result and verifying it. Aaronson said AI companies were discreetly testing whether internal models could break important cryptographic protocols; this account is attributed to his sources, and no specific successful attack is identified.
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.
Security Plans Face a Second Unknown
Finance, intelligence agencies and militaries rely on cryptography to protect transactions, communications, identities and stored information. Their current planning has focused heavily on the risk from sufficiently capable quantum computers. The new concern raised by the source is different: an AI-assisted algorithm might improve the way a problem is solved on ordinary computers, without the visible hardware milestones that make quantum progress easier to monitor.
This matters for migration schedules. Organizations replacing older public-key systems need to decide which standards to adopt, how quickly to update large networks and how to protect information that must remain confidential for years. If the mathematical assumptions behind a replacement are later weakened, a migration could leave them exposed in a different way. That is a **planning risk**, not evidence that current standards have failed; the source explicitly says nothing has been broken.
Public blockchains offer a visible example of the stakes because some public keys can be observed and associated with assets. Ethereum Foundation researcher Justin Drake urged calm preparation for a possible “bunker mode,” while Vitalik Buterin cautioned against an immediate rush to move funds. Their disagreement reflects uncertainty about timing and severity, not confirmation of an attack. For banks and defence organizations, the practical question is how to prepare without treating speculative results as operational facts.
quantum-safe cryptography hardware
As an affiliate, we earn on qualifying purchases.
As an affiliate, we earn on qualifying purchases.
Quantum Migration Meets AI Research
For roughly a decade, much security planning has treated quantum computing as the main long-term challenge to widely used public-key cryptography. A sufficiently capable quantum computer running **Shor’s algorithm** could break RSA and elliptic-curve cryptography. Governments and organizations have consequently begun preparing to replace vulnerable systems before such machines become available.
In August 2024, the U.S. National Institute of Standards and Technology standardized **ML-KEM** for key establishment and **ML-DSA** for digital signatures, both based on lattices, alongside **SLH-DSA**, a signature standard based on hash functions. Those standards are part of the post-quantum response; their adoption does not mean that every organization has completed migration. The source frames AI mathematics as a separate uncertainty that could affect confidence in mathematical assumptions, including those used in newer approaches, but provides no demonstrated break of these standards.
The public discussion sharpened on October 7, when Drake called for planning around exposed blockchain keys. The next day, Buterin argued that attention should not focus only on elliptic curves and raised concern about lattice-based cryptography and fully homomorphic encryption. His point was that mathematical methods can improve over time: systems once thought difficult may become more tractable after new techniques are discovered. That observation is a warning about assumptions, not proof that a comparable breakthrough exists for today’s cryptography.
““Calmly begin planning for ‘bunker mode’.””
— Justin Drake, Ethereum Foundation researcher
As an affiliate, we earn on qualifying purchases.
No Cryptographic Break Is Reported
The central uncertainty is whether any AI-generated mathematical work can be independently verified and then applied to a real cryptographic system. The source says that checking the manuscripts is a bottleneck and describes at least one withdrawn claim after an error was found. It does not identify a verified algorithm that recovers cryptographic keys or defeats NIST’s standards.
It is also unclear what internal testing by AI companies has found. Aaronson’s account of discreet protocol testing is based on sources he cited, and the supplied material gives no technical details, results or independent confirmation. Nor does it establish that AI will produce a useful cryptanalytic advance, how soon one might appear, or which systems would be affected. The risk described is that a discovery could be developed and kept secret, making it harder to track than progress in quantum hardware.
Drake’s warning includes a specific hypothetical definition of a break—recovering a private key in about a week on a large GPU cluster—but the source offers no evidence that this capability exists. The reported estimate of roughly **6 million bitcoin** in addresses with exposed public keys is a count, not a measure of coins known to be vulnerable to a current attack.
quantum computing resistance devices
As an affiliate, we earn on qualifying purchases.
As an affiliate, we earn on qualifying purchases.
Verification and Migration Decisions
The immediate next step is mathematical and technical review of the published work. Independent researchers will need to check the claims, determine whether any results change established complexity assumptions and assess whether those results translate into practical methods against cryptographic protocols. The supplied material gives no timetable for that review or confirmation that any specific claim will survive it.
Financial institutions, government agencies and defence organizations will continue to face the existing task of inventorying cryptographic systems and planning post-quantum upgrades. The new warnings may prompt closer scrutiny of the assumptions behind both current and replacement systems, but the source does not describe new government directives, revised standards or migration deadlines. Any changes will depend on verified technical findings rather than the manuscript count alone.
For blockchain users, Drake and Buterin offered different emphases: prepare for possible exposure, but do not rush into transfers solely on the basis of speculation. The source does not report a coordinated industry action or an active exploit. The key developments to watch are independent verification of the manuscripts, disclosures from AI companies about protocol testing, and concrete evidence—if any—that a new method affects deployed cryptography.
digital security encryption products
As an affiliate, we earn on qualifying purchases.
As an affiliate, we earn on qualifying purchases.
Key Questions
Did AI break encryption or a cryptographic protocol?
No such break is reported in the supplied material. It describes mathematical claims and warnings about potential risks, not a demonstrated attack on a deployed system.
What did OpenAI publish?
OpenAI published 722 mathematical manuscripts on October 6, grouped into 372 families and produced with an unreleased internal model. The claims remain subject to checking, and the source notes that one claimed proof was withdrawn after an error was found.
A sufficiently capable quantum computer could use Shor’s algorithm against RSA and elliptic-curve cryptography. The AI-related concern is that a model could help discover a better algorithm for ordinary computers; the source says no such cryptographic breakthrough has been verified.
Should blockchain users move their funds now?
The source reports that Justin Drake advised planning for possible exposure, while Vitalik Buterin said he did not recommend scrambling to move funds immediately. It provides no evidence of an active exploit or a confirmed need for users to transfer assets.
What should finance and defence organizations watch for?
They should watch for independent verification of the mathematical claims, credible technical evidence about effects on specific cryptographic systems, and any formal revisions to standards or migration guidance. The source reports no new directive or deadline.
Source: ThorstenMeyerAI.com
Halloween Picks
halloween
As an affiliate, we earn on qualifying purchases.
