Cluster Computing

, Volume 15, Issue 1, pp 53–68 | Cite as

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
  • Heinz Stockinger
Article

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.

Keywords

RSA HPC Integer factorization 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aoki, K., Franke, J., Kleinjung, T., Lenstra, A.K., Osvik, D.A.: A kilobit special number field sieve factorization. In: Asiarcypt. LNCS, vol. 4833, pp. 1–12. Springer, Berlin (2007) Google Scholar
  2. 2.
    Aoki, K., Shimoyama, T., Ueda, H.: Experiments on the linear algebra step in the number field sieve. In: IWSEC. LNCS, vol. 4752, pp. 58–73. Springer, Berlin (2007) Google Scholar
  3. 3.
  4. 4.
    Capit, N., Costa, G.D., Georgiou, Y., Huard, G., Martin, C., Mounié, G., Neyron, P., Richard, O.: A batch scheduler with high level components. In: CCGRID, pp. 776–783. IEEE Comput. Soc., Los Alamitos (2005) Google Scholar
  5. 5.
  6. 6.
    Coppersmith, D.: Solving linear equations over GF(2): block Lanczos algorithm. Linear Algebra Appl. 192, 33–60 (1993) MathSciNetMATHCrossRefGoogle Scholar
  7. 7.
    Coppersmith, D.: Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm. Math. Comput. 62, 333–350 (1994) MathSciNetMATHGoogle Scholar
  8. 8.
  9. 9.
  10. 10.
    Gordon, D.M., McCurley, K.S.: Massively parallel computation of discrete logarithms. In: Crypto. LNCS, vol. 740, pp. 312–323. Springer, Berlin (1992) Google Scholar
  11. 11.
    Kleinjung, T., Aoki, K., Franke, J., Lenstra, A.K., Thomé, E., Bos, J.W., Gaudry, P., Kruppa, A., Montgomery, P.L., Osvik, D.A., te Riele, H.J.J., Timofeev, A., Zimmermann, P.: Factorization of a 768-bit RSA modulus. In: Crypto. LNCS, vol. 6223, pp. 333–350. Springer, Berlin (2010) Google Scholar
  12. 12.
    Lenstra, A.K., Lenstra, H.W. Jr.: The Development of the Number Field Sieve. LNM, vol. 1554. Springer, Berlin (1993) MATHCrossRefGoogle Scholar
  13. 13.
    Lenstra, A.K., Manasse, M.S.: Factoring by electronic mail. In: Eurocrypt. LNCS, vol. 434, pp. 355–371. Springer, Berlin (1989) Google Scholar
  14. 14.
  15. 15.
    The rsa factoring challenge faq. http://www.rsa.com/rsalabs/node.asp?id=2094
  16. 16.
    Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pp. 124–134. IEEE Comput. Soc., Los Alamitos (1994) CrossRefGoogle Scholar
  17. 17.
    Stockinger, H., Pagni, M., Cerutti, L., Falquet, L.: Grid approach to embarrassingly parallel CPU-intensive bioinformatics problems. In: E-SCIENCE’06. IEEE Comput. Soc., Los Alamitos (2006) Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  • Thorsten Kleinjung
    • 1
  • Joppe W. Bos
    • 1
  • Arjen K. Lenstra
    • 1
  • Dag Arne Osvik
    • 1
  • Kazumaro Aoki
    • 2
  • Scott Contini
    • 3
  • Jens Franke
    • 4
  • Emmanuel Thomé
    • 5
  • Pascal Jermini
    • 6
  • Michela Thiémard
    • 6
  • Paul Leyland
    • 7
  • Peter L. Montgomery
    • 8
    • 9
  • Andrey Timofeev
    • 9
  • Heinz Stockinger
    • 10
  1. 1.EPFL IC LACALLausanneSwitzerland
  2. 2.NTTTokyoJapan
  3. 3.Macquarie UniversitySydneyAustralia
  4. 4.Department of MathematicsUniversity of BonnBonnGermany
  5. 5.INRIA CNRS LORIA, Équipe CARAMELVillers-lès- Nancy CedexFrance
  6. 6.EPFL AI DITLausanneSwitzerland
  7. 7.Brnikat LtdCambridgeUK
  8. 8.Microsoft ResearchRedmondUSA
  9. 9.CWIAmsterdamThe Netherlands
  10. 10.Vital-IT GroupSwiss Institute of BioinformaticsLausanneSwitzerland

Personalised recommendations