A heterogeneous computing environment to solve the 768-bit RSA challenge
Kleinjung, Thorsten ; Bos, Joppe ; Lenstra, Arjen ; Osvik, Dag ; Aoki, Kazumaro ; Contini, Scott ; Franke, Jens ; Thomé, Emmanuel ; Jermini, Pascal ; Thiémard, Michela ; Leyland, Paul ; Montgomery, Peter ; Timofeev, Andrey ; Stockinger, Heinz
In: Cluster Computing, 2012, vol. 15, no. 1, p. 53-68
Ajouter à la liste personnelle- Summary
- 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