här lite om RSA :wink:

RSA-129 = 11438162575788886766923577997614661201021829672124 23625625618429\
35706935245733897830597123563958705058989075147599 290026879543541
= 34905295108476509491478496199038981334177646384933 87843990820577 *
32769132993266709549961988190834461413177642967992 942539798288533


The encoded message published was

96869613754622061477140922254355882905759991124574 3198746951209308162\
98225145708356931476622883989628013391990551829945 157815154

This number came from an RSA encryption of the `secret' message using the
public exponent 9007. When decrypted with he `secret' exponent

10669861436857802444286877132892015478070990663393 7862801226224496631\
06312591177447087334016859746230655396854451327710 9053606095

this becomes

20080500130107090300231518041900011805001917210501 1309190800151919090\
618010705

Using the decoding scheme 01=A, 02=B, ..., 26=Z, and 00 a space between


To find the factorization of RSA-129, we used the double large prime
variation of the multiple polynomial quadratic sieve factoring method.
The sieving step took approximately 5000 mips years, and was carried
out in 8 months by about 600 volunteers from more than 20 countries,
on all continents except Antarctica. Combining the partial relations
produced a sparse matrix of 569466 rows and 524338 columns. This matrix
was reduced to a dense matrix of 188614 rows and 188160 columns using
structured Gaussian elimination. Ordinary Gaussian elimination on this
matrix, consisting of 35489610240 bits (4.13 gigabyte), took 45 hours
on a 16K MasPar MP-1 massively parallel computer. The first three
dependencies all turned out to be `unlucky' and produced the trivial
factor RSA-129. The fourth dependency produced the above factorization.

We would like to thank everyone who contributed their time and effort
to this project. Without your help this would not have been possible