Cryptographers have achieved the largest general integer factorization ever performed, successfully cracking a 260-digit number known as RSA-260. The feat marks a significant step forward in computational number theory and renews discussions about the long-term security of widely used encryption systems.

What You Need to Know

Factoring RSA-260 does not immediately threaten standard RSA key sizes such as 2048 bits, which are roughly 617 decimal digits. However, each new record reduces the practical safety margin. Security guidelines already recommend 3072-bit or larger keys for long-term use. The achievement underscores the steady improvement of factoring algorithms and distributed computing methods.

The RSA Factoring Challenge

RSA Laboratories created the RSA factoring challenge in 1991 to encourage research into integer factorization. The contest offered cash prizes for factoring increasingly difficult published numbers. RSA-260 belonged to the second generation of challenges, which were retired in 2007 but remain active research targets. Previous milestones included factoring RSA-240 in 2019 and RSA-250 in 2020.

Techniques Behind the Record

The team employed the Number Field Sieve algorithm, the same method used for previous records, but optimized its polynomial selection and sieving stages. A distributed network of thousands of volunteer computers contributed to the computation over several months. The final linear algebra step required specialized clusters running for weeks.

  • Number Field Sieve: The most efficient known algorithm for factoring large numbers, requiring both CPU time and memory bandwidth.
  • Distributed Computing: Volunteers ran client software on personal computers, aggregating partial results to reduce overall time.
  • Linear Algebra Phase: A dense matrix problem solved on dedicated hardware, often the bottleneck in large factorizations.

Why This Matters

The factorization of RSA-260 directly affects the security community’s trust in RSA-based encryption over long horizons. While 1024-bit keys remain safe against known attacks today, the trend line suggests that 1536-bit and even 2048-bit moduli could become vulnerable within a few decades if algorithmic improvements continue. Organizations responsible for data that must stay confidential for 20 years or more should accelerate migration to elliptic curve cryptography or prepare for post-quantum standards now. The result also reinforces the importance of periodic security audits and key size reviews.

Looking Ahead

The next targeted milestone will likely be RSA-280, equivalent to roughly 848 decimal digits. Achieving that would require substantially greater resources but remains plausible within the next decade. Meanwhile, standardization bodies such as NIST will factor this development into their next round of guidelines, possibly raising minimum recommended key sizes for high-security applications.