A heterogeneous computing environment to solve the 768-bit RSA challenge
Thorsten Kleinjung, Joppe W. Bos, Arjen K. Lenstra, Dag Arne Osvik, Kazumaro Aoki, Scott Contini, Jens Franke, Emmanuel Thomé, Pascal Jermini, Michela Thiémard, Paul Leyland, Peter L. Montgomery, Andrey Timofeev, and Heinz Stockinger
2010
In December 2009 the 768-bit, 232-digit number RSA-768 was factored using the number field sieve. Overall, the computational challenge would take more than 1700 years on a single, standard core. In the article we present the heterogeneous computing approach, involving different compute clusters and Grid computing environments, used to solve this problem.
In Cluster Computing
Publisher Springer
Details
| Type | Article |
| URL | http://www.springerlink.com/content/p58787322q000j77/ |
| Pages | 1–16 |
| Volume | 15 |
| Number | 1 |
Related People
Share
