RSA-140
|
|
In mathematics, RSA-140 is one of the RSA numbers, large semiprimes that are part of the RSA Factoring Challenge. It was factored on February 2 1999 by a team led by Herman J. J. te Riele and comprised of Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra, Paul Leyland, Walter Lioen, Peter Montgomery, Brian Murphy and Paul Zimmermann.
The factorization of RSA-140 is as follows:
RSA-140 = 2129024631825875754749788201627151749780670396327721627823338321538194
9984056495911366573853021918316783107387995317230889569230873441936471
RSA-140 = 3398717423028438554530123627613875835633986495969597423490929302771479
* 6264200187401285096151654948264442219302037178623509019111660653946049
The factorisation was found using the Number Field Sieve algorithm and an estimated 2000 MIPS-years of computing time.
External links
- Announcement of factorization of RSA-140 from Herman te Riel (http://listserv.nodak.edu/scripts/wa.exe?A2=ind9902&L=nmbrthry&P=302)
- RSA Labs take on the factorization (http://www.rsasecurity.com/rsalabs/node.asp?id=2099)fr:RSA-140