A Heterogeneous Computing Environment to Solve the 768-bit RSA Challenge

Abstract : 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.
Liste complète des métadonnées

https://hal.inria.fr/inria-00535765
Contributor : Emmanuel Thomé <>
Submitted on : Friday, November 12, 2010 - 4:13:55 PM
Last modification on : Thursday, February 7, 2019 - 5:14:11 PM

Links full text

Identifiers

Citation

Thorsten Kleinjung, Joppe Bos, Arjen Lenstra, Dag Arne Osvik, Kazumaro Aoki, et al.. A Heterogeneous Computing Environment to Solve the 768-bit RSA Challenge. Cluster Computing, Springer Verlag, 2012, 15 (1), pp.53-68. ⟨10.1007/s10586-010-0149-0⟩. ⟨inria-00535765⟩

Share

Metrics

Record views

664