Editing RSA numbers (section)

==RSA-100==
RSA-100 has 100 decimal digits (330 bits). Its factorization was announced on April 1, 1991, by [[Arjen Lenstra|Arjen K. Lenstra]].<ref name="RSA Honor Roll">{{Cite mailing list |last=RSA Factoring Challenge Administrator (challenge-administrator@majordomo.rsasecurity.com) |title=RSA Honor Roll |mailing-list=challenge-rsa-honor-roll@rsa.com |date=30 Jan 2002 |orig-date=March 5, 1999 |url=http://www.ontko.com/pub/rayo/primes/hr_rsa.txt |archive-url=https://web.archive.org/web/20230909141925/http://www.ontko.com/pub/rayo/primes/hr_rsa.txt |archive-date=2023-09-09 |url-status=live |via=Ray Ontko}}</ref><ref name="Cryptowatch RSA pg. 2">{{Cite web |date=July 9, 1993 |title=Archive for the 'RSA' Category |url=http://cryptnet.net/people/vab/blogs/cryptowatch/category/rsa/page/2/ |url-status=dead |archive-url=https://web.archive.org/web/20090108141629/http://cryptnet.net/people/vab/blogs/cryptowatch/category/rsa/page/2/ |archive-date=2009-01-08 |website=Cryptography Watch |page=2}}</ref> Reportedly, the factorization took a few days using [[quadratic sieve|the multiple-polynomial quadratic sieve algorithm]] on a [[MasPar]] parallel computer.<ref name="Lenstra">{{Cite book |last1=Dixon |first1=Brandon |last2=Lenstra |first2=Arjen K. |title=Advances in Cryptology — EUROCRYPT '93 |chapter=Factoring Integers Using SIMD Sieves |date=1994 |editor-last=Helleseth |editor-first=Tor |chapter-url=https://link.springer.com/chapter/10.1007/3-540-48285-7_3 |series=Lecture Notes in Computer Science |language=en |location=Berlin, Heidelberg |publisher=Springer |publication-date=13 July 2001 |volume=765 |pages=28–39 |doi=10.1007/3-540-48285-7_3 |isbn=978-3-540-48285-7 |s2cid=21157010 |via=SpringerLink}}</ref>

The value and factorization of RSA-100 are as follows:

 RSA-100 = 1522605027922533360535618378132637429718068114961380688657908494580122963258952897654000350692006139

 RSA-100 = 37975227936943673922808872755445627854565536638199
         × 40094690950920881030683735292761468389214899724061

It takes four hours to repeat this factorization using the program Msieve on a 2200&nbsp;MHz [[Athlon 64]] processor.

The number can be factorized in 72 minutes on overclocked to 3.5&nbsp;GHz Intel Core2 Quad q9300, using GGNFS and Msieve binaries running by distributed version of the factmsieve Perl script.<ref name="mersenneforum.org">{{cite web |last=chris2be8 |date=2012-03-27 |title=Distributed polynomial selection. |url=http://mersenneforum.org/showpost.php?p=294403&postcount=13/ |url-status=live |archive-url=https://web.archive.org/web/20230702220137/https://mersenneforum.org/showpost.php?p=294403&postcount=13/ |archive-date=2023-07-02 |access-date=2015-06-08 |website=mersenneforum.org}}</ref>