RSA-129
From Wikipedia, the free encyclopedia
In mathematics, RSA-129 is one of the RSA numbers, large semiprimes that are part of the RSA Factoring Challenge. It was factored in April 1994 by a team led by Derek Atkins, Michael Graff, Arjen K. Lenstra, and Paul Leyland, using about 600 computers connected over the Internet; a $100 USD token prize was awarded by RSA Security for the factorisation, which was donated to the Free Software Foundation.
The factorization of RSA-129 is as follows:
RSA-129 = 11438162575788886766923577997614661201021829672124236256256184293
5706935245733897830597123563958705058989075147599290026879543541
RSA-129 = 3490529510847650949147849619903898133417764638493387843990820577
* 32769132993266709549961988190834461413177642967992942539798288533
The factorisation was found using the Multiple Polynomial Quadratic Sieve algorithm.
The factoring challenge included a message encrypted with RSA-129. When decrypted using the factorisation the message was revealed to be "The Magic Words are Squeamish Ossifrage".
[edit] External links
- Mark Janeba: Factoring challenge conquered
- Encryption cracking article on Wired.com - has much coverage on RSA-129
 |
This cryptography-related article is a stub. You can help Wikipedia by expanding it. |
