RSA-260 Factorized
samyok
16 points
3 comments
September 03, 2026
Related Discussions
Found 5 related stories in 55.5ms across 5,468 title embeddings via pgvector HNSW
- An elliptic curve of rank ≥ 30 robinhouston · 93 pts · August 20, 2026 · 46% similar
- SeL4 security proofs now complete on AArch64 snvzz · 178 pts · August 24, 2026 · 43% similar
- Harvest (IBM 7950): Supercomputer for cryptanalysis at the NSA in the Cold War jnord · 90 pts · August 26, 2026 · 41% similar
- Xorshift Generators tobr · 40 pts · August 15, 2026 · 41% similar
- Belfort Releases Fastest Encrypted Image Classifer furkanturan · 16 pts · July 17, 2026 · 41% similar
Discussion Highlights (3 comments)
samyok
anddd it's already on wikipedia https://en.wikipedia.org/wiki/RSA_numbers#RSA-260
dclavijo
What was the methodology,software, hardware, cpu cores, time taken?
nk_kolja
Impressive. I wonder the methodology. Algorithmic improvements? More probably just an implementational optimisation. Last RSA record was due to special q sieving methods if I recall well, some 3k core hours. I hope there’s a theoretical improvement behind the result.