AI Agents Just Made 1024-Bit RSA Cheaper to Attack: The Problem Isn't the Math, It's the Keys Nobody Remembers

2026-11-09 · By H.A

AI Agents Just Made 1024-Bit RSA Cheaper to Attack: The Problem Isn't the Math, It's the Keys Nobody Remembers

AI Agents Just Made 1024-Bit RSA Cheaper to Attack: The Problem Isn't the Math, It's the Keys Nobody Remembers

DeepMind's human-guided agents found two new weaknesses in legacy 1024-bit RSA, and that turns a long-postponed crypto cleanup into an inventory problem that AI will keep making more urgent.

What was announced

On 6 November, Google DeepMind said that AI agents, guided by human researchers, had found two new weaknesses in 1024-bit RSA. The work was led by DeepMind researchers with collaborators from the University of California San Diego and France's Inria. DeepMind's Chief Scientist Pushmeet Kohli announced it publicly, saying the results show why cryptographic assumptions need to be reassessed regularly as AI gets better at advanced mathematics.

The two findings, as described by DeepMind and in reporting on the announcement:

Two caveats matter. First, the 1,600x and 30x figures are theoretical estimates of how the cost scales, not measured attacks. The hands-on part was a sandbox test against a 1024-bit benchmark key that academics had already broken: the agent-written code reproduced the known forgery with about 3.5 times less CPU time. Second, 2048-bit and larger keys are not affected. Nobody has "broken RSA".

Why this is still a big deal

1024-bit RSA was supposed to be gone years ago. NIST deprecated it for new signatures more than a decade ago, and browsers stopped trusting 1024-bit certificate chains around the same time. Yet it never really left. It hangs on wherever cryptography was set once and then forgotten:

The usual reasoning has been that factoring one 1024-bit modulus is still very expensive, so the risk is fine. Both findings attack that reasoning from different directions.

The batch result changes the economics for attackers who want many keys instead of one. Batch factoring is exactly what a well-funded adversary with a big list of collected public keys would do. Making each extra key about 30 times cheaper turns a pile of legacy keys into a much better target.

The signature result hits a different assumption, that padding makes up for a short modulus. Wherever an attacker can influence most of what gets signed, the margin turns out to be much thinner than people thought.

The more important story: AI as a cryptanalyst

The individual numbers matter less than how they were produced. Earlier this month, OpenAI described an automated run that turned hundreds of Linux kernel bugs into working local-root exploits. Now DeepMind shows agents helping to push forward the mathematics of a public-key algorithm that has been studied for nearly 50 years.

DeepMind is careful to call this human-guided research, not autonomous discovery, and that framing deserves respect. Still, the direction is clear. The rate at which "theoretical weakness" becomes "practical attack" has always depended on how many expert researcher-hours went into a problem. AI agents add researcher-hours cheaply, so the safety margins we set using history ("this took 15 years to get cheaper, so we have time") are now less reliable.

There is a defensive point too. The same kind of work tells defenders which margins are thinner than they believed, and it did so in public, against a key size that should already be retired. That is the best case. The worse case is that well-resourced groups reach similar results quietly.

What this is not

To keep it in proportion:

Practical takeaways

The useful response is an inventory, not panic.

# Certificate or public key size
openssl x509 -in cert.pem -noout -text | grep "Public-Key"
# SSH host keys (prints bit length first)
for k in /etc/ssh/ssh_host_*_key.pub; do ssh-keygen -lf "$k"; done
# DKIM: fetch the public key record for a selector, then check its length
dig +short TXT selector._domainkey.example.com
REEF SENTINEL