Researcher Factored 896-Bit RSA Number
The achievement demonstrates a significant advancement in classical factoring using AI-optimized algorithms.
Updated on Sept. 20, 2026 in Quantum Computing
Live Poll
Do you trust current digital encryption standards to remain secure against AI-assisted attacks?
Stephen A. Weis successfully factored a 896-bit RSA number on September 19, 2026. The milestone follows the factoring of RSA-260 by Eric Lu on September 3, 2026, showcasing rapid progress in computational cryptanalysis.
Why it matters
The increasing efficiency of classical factoring, now accelerated by AI-driven optimizations, highlights the narrowing gap between computational power and current cryptographic standards. These developments signal a potential shift in the projected longevity of existing encryption protocols like 2048-bit RSA.
The record-breaking 896-bit semiprime contains 270 decimal digits, surpassing the 2020 benchmark of 829 bits. Previous work on the 260-bit variant required 4,900 GPU-days of compute, costing approximately $400,000.
The players
Stephen A. Weis
A researcher focused on the boundaries of classical computational cryptanalysis and factoring techniques.
Eric Lu
A researcher known for executing large-scale computational factoring projects utilizing GPU-intensive clusters.
The details
Researchers utilized the general number field sieve, an algorithm for finding prime factors of large integers, to perform the calculations. The process was augmented by AI models designed to optimize classical factoring approaches by reducing the computational steps required. This integration of machine learning allows for more efficient identification of prime factors compared to traditional brute-force or standard sieve implementations.
Timeline
1991-2007: Duration of the RSA Factoring Challenge.
2020: Year the previous 829-bit record was set.
September 3, 2026: Eric Lu completed the factoring of RSA-260.
September 19, 2026: Stephen A. Weis completed the factoring of RSA-896.
The Tech Race
The RSA Factoring Challenge formally concluded in 2007, yet research into factoring large integers has continued to expand as compute efficiency improves. These new records demonstrate that the factoring difficulty curve is steepening, potentially challenging the long-term viability of current encryption standards.
While these results concern researchers and cryptographers, they do not yet render 2048-bit RSA keys insecure for common user applications. The primary impact is on the research community, which must now calibrate security timelines against faster, AI-assisted factoring capabilities.
The takeaway
The rapid cadence of these results suggests that classical factoring limits are evolving faster than historically projected. Observers should track subsequent benchmarks for signs that the gap between these new records and 2048-bit keys is closing.
Further reading
For broader context on how modern computational methods affect standard security practices, explore Quantum Computing.
Live Poll
Do you trust current digital encryption standards to remain secure against AI-assisted attacks?
