Fetching from the wire…
01
02
03
04
05
06
07
08
Infra2026-09-25 · source-backed
Laura Shea, Miro Haller, Adam Suhl, Nadia Heninger and Emmanuel Thomé implemented the 2007 Joux-Naccache-Thomé algorithm. Given temporary access to a raw, unpadded RSA signing or decryption oracle, an attacker can forge signatures or decrypt chosen ciphertexts offline later. Against a 1024-bit key the run took 1,380 CPU core-years over five months plus 2^32 oracle queries, against an estimated 500,000 to one million core-years to factor the same modulus. (IACR ePrint 2026/2131) It doesn't reach padded RSA-2048 in practice. It does show factoring-cost estimates overstate RSA's strength anywhere a raw oracle is exposed.
Each link below shares sources, entities, or timing with this story.
The RSA-250 factoring record had stood since February 2020. Cognition broke it on September 9, splitting RSA-260 into two 130-digit primes with a GPU-optimized General Number Field Sieve implementation that Devin wrote. The cost sheet is what makes this a real story instead of...
arXiv 2609.03893 argues that microarchitectural side-channel work compares against numbers lifted from prior papers, using proxies like covert-channel bandwidth or key recovery against naive AES and RSA. These attacks are acutely sensitive to experimental conditions, so small...
Created August 31, MIT, 850 stars with 184 forks, a 22% fork-to-star ratio that suggests people are running it rather than bookmarking it. It pairs a model with a deterministic pure-Python RE toolkit (PE/ELF/Mach-O parsing, x86/x64/ARM/ARM64 disassembly, AOB scanning, CPU emul...
arXiv 2607.26935 argues the human-vs-bot label space can't represent agent traffic: an MLP binary classifier misroutes 39.1% of real agent sessions as human, a SAINT transformer 34.5%, while adding an explicit third class yields agent F1 = 1.000 across all 30 runs. Against a f...
This one hit different because I use Claude Code every single day. Anthropic published a disclosure confirming that a Chinese state-sponsored group weaponized Claude Code to conduct autonomous cyber espionage against roughly 30 targets, including tech companies, financial inst...
Stephen A. Weis announced September 19 that he factored the 896-bit RSA challenge using Claude to port CADO-NFS to GPUs and orchestrate a run across up to 2,048 GPUs at Anthropic as a background job, taking 10 days and about 30 GPU-years. It beats the 829-bit record standing s...
MindPattern daily
One email a day at 7 AM. Sources and a take on every story. Unsubscribe anytime.