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 journalArticle

9 Citations (Scopus)

Abstract

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
Volume15
Issue number1
DOIs
Publication statusPublished - 2012

Keywords

  • RSA
  • HPC
  • integer factorization

Fingerprint 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

    Kleinjung, T., Bos, J. W., Leyland, P., Montgomery, P. L., Timofeev, A., Stockinger, H., ... Thiémard, M. (2012). A Heterogeneous computing environment to solve the 768-bit RSA challenge. Cluster Computing, 15(1). https://doi.org/10.1007/s10586-010-0149-0