A Heterogeneous computing environment to solve the 768-bit RSA challenge

Thorsten Kleinjung, Joppe W. Bos, Paul Leyland, Peter L. Montgomery, Andrey Timofeev, Heinz Stockinger, Arjen K. Lenstra, Dag Arne Osvik, Kazumaro Aoki, Scott Contini, Jens Franke, Emmanuel Thomé, Pascal Jermini, Michela Thiémard

Research output: Contribution to journalArticlepeer-review

12 Citations (Scopus)


Published online 24 December 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.
Original languageEnglish
Number of pages16
JournalCluster Computing
Issue number1
Publication statusPublished - 2012


  • RSA
  • HPC
  • integer factorization


Dive into the research topics of 'A Heterogeneous computing environment to solve the 768-bit RSA challenge'. Together they form a unique fingerprint.

Cite this