RSA-155

From Wikipedia, the free encyclopedia

You have new messages (last change).

In mathematics, RSA-155 is one of the RSA numbers, large semiprimes that are part of the RSA Factoring Challenge. It was factored on August 22, 1999 by a team led by Herman te Riele and comprised of Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra, Walter Lioen, Peter L. Montgomery, Brian Murphy, Karen Aardal, Jeff Gilchrist, Gerard Guillerm, Paul Leyland, Joel Marchand, Francois Morain, Alec Muffett, Craig Putnam, Chris Putnam and Paul Zimmermann.

The factorization of RSA-155 is as follows:

RSA-155 = 109417386415705274218097073220403576120037329454492059909138421314763499842889
          34784717997257891267332497625752899781833797076537244027146743531593354333897

RSA-155 = 102639592829741105772054196573991675900716567808038066803341933521790711307779 
        * 106603488380168454820927220360012878679207958575989291522270608237193062808643

The factorisation was found using the Number Field Sieve algorithm and an estimated 8000 MIPS-years of computing time.

[edit] External links

This cryptography-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../r/s/a/RSA-155_355f.html"
In other languages