Software engineer at @anthropicai interested in cryptography, security, privacy, and machine learning.
San Francisco
- Tweets 8,370
- Following 2,796
- Followers 13,327
- Likes 5
"Forging 1024-bit RSA signatures in nearly SNFS time" by using oracle access by Shea, Haller, Suhl, Heninger, and Thomé.
github.com/ucsd-hacc/NSNFSSS…
1
10
33
3,126
Steve Weis retweeted
I have attacks on 14 candidates in the NGCC but they still have not approved me as poster. Anyway, zero postings by anyone thus far.
5
21
305
37,237
Chinese Next-generation Commercial Cryptographic Algorithms program submissions posted:
niccs.org.cn/niccs/Proposal/…
5
6
37
7,052
636606729769440499166579950236036751749912014371509557713570027508971809534551913252252094954941974952859310861988904737359709200557919
is a factor of RSA-896
saweis.net/posts/rsa-896.htm…
226
990
9,509
3,905,213
Also to clarify:
- No new algorithmic factoring improvements.
- It’s still exponential.
- No new threats to deployed keys.
9
19
761
163,560
Claude is very good at making interactive artifacts like this McEliece Attack Explorer:
claude.ai/artifact/GG3mpFety…
1
1
28
9,299
.@mcpherrinm factored the RSA keys of a Certificate Authority...
… from the 90s.
(Don't worry, they are wee 512-bit keys that have been factorable for decades.)
mcpherrin.ca/2026/09/07/rsa.…
5
25
6,808
“Computing 256-bit elliptic curve discrete logarithms in 26 days on a fault-tolerant trapped-ion quantum computer with 20,000 qubits”
eprint.iacr.org/2026/1916
4
10
49
8,716
Steve Weis retweeted
Checking that a major mathematical proof is correct can take years. Formalization—converting the mathematical reasoning into a form computer proof assistants like Lean can verify—can help.
Last month, Claude completed the first formalized proof of Fermat’s Last Theorem, one of the most famous theorems of all time. This was a project experts thought would take many years. It is the largest Lean proof ever written.
Fermat’s Last Theorem was first proven in 1995 by Sir Andrew Wiles, more than 350 years after it was conjectured. Our proof, which totals over 13 million lines of code, provides machine verification. More importantly, it proves over 29,000 other theorems that the proof requires, across many areas of math which had never before been formalized.
We see this as a major step in the long process of firming up the core of mathematical knowledge, building on work from three centuries of mathematicians and hundreds of contributors to Lean and Mathlib. We are optimistic that AI-assisted verification of mathematical proofs will help reduce the burden of refereeing mathematics in an era where more proofs are being produced than ever before.
You can read about the process on our Science Blog: anthropic.com/research/forma…
And see the complete proof on GitHub: github.com/anthropics/fermat…
663
1,880
14,150
4,737,194
About the new RSA-260 record set by @penlume:
The backstory is the last RSA-250 record was set by a team of academics in 2020 using CADO-NFS and took 2,700 CPU-core hours: cado-nfs.gitlabpages.inria.f…
Note, "260" is decimal digits, rather than 862 bits we'd normally call it.
4397328654844826923795068102505872571721883526553349659561256924505973939597593482272505698004801207988043088656411102133523080581 divides RSA-260
5
27
140
26,676
Incidentally, I estimate RSA-1024 (bits, not digits) would take 2,000 GPU-years.
To put this in context, a single cluster in a modern hyperscaler might have 100,000 GPUs.
GNFS doesn't fully parallelize across that, but this capacity could factor a RSA-1024 in weeks.
8
10
97
38,496