RSA-129

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 Arjen K. Lenstra, 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".

~ ~ ~ ~ ~ ~ ~ ~ ~ ~

RSA-129: External links ►



 

RSA number: REDIRECT RSA numbers...

Semiprime: In mathematics, a semiprime (also called biprime or 2-almost prime, or pq number) is a natural number that is the product of two (not necessarily distinct) prime numbers. The first few semiprimes are 4, 6, 9, 10, 14, 15, 21, 22, 25, 26, ... ....

RSA Factoring Challenge: The RSA Factoring Challenge is a challenge put forward by RSA Laboratories on March 18 1991 to encourage research into computational number theory and the practical difficulty of factoring large integers. They published a list of semiprimes (numbers with exactly two prime factors) known as the RSA n...