Information AboutRsa-200 |
| CATEGORIES ABOUT RSA-200 | |
| rsa factoring challenge | |
|
In Mathematics , RSA-200 is one of the RSA Number s, large Semiprime s that are part of the RSA Factoring Challenge . RSA-200 has a length of 200 Decimal digits and factors into the two 100-digit primes given below. The factorization was announced on May 9 2005 by F. Bahr, M. Boehm, J. Franke , and T. Kleinjung . The Factorization was found using the General Number Field Sieve algorithm. RSA-200 = 2799783391122132787082946763872260162107044678695542853756000992932612840010 7609345671052955360856061822351910951365788637105954482006576775098580557613 579098734950144178863178946295187237869221823983 RSA-200 = 3532461934402770121272604978198464368671197400197625023649303468776121253679 423200058547956528088349
152135381409304740185467 The CPU time spent on finding these factors by a collection of parallel computers amounted very approximately to the equivalent of 55 years work for a single 2.2 GHz Opteron -based computer. Note that while this approximation serves to suggest the scale of the effort, it leaves out many complicating factors; the announcement states it more precisely. EXTERNAL LINKS |
|
|