Factorization of a 768-Bit RSA Modulus

  • Thorsten Kleinjung
  • Kazumaro Aoki
  • Jens Franke
  • Arjen K. Lenstra
  • Emmanuel Thomé
  • Joppe W. Bos
  • Pierrick Gaudry
  • Alexander Kruppa
  • Peter L. Montgomery
  • Dag Arne Osvik
  • Herman te Riele
  • Andrey Timofeev
  • Paul Zimmermann
Conference paper

DOI: 10.1007/978-3-642-14623-7_18

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6223)
Cite this paper as:
Kleinjung T. et al. (2010) Factorization of a 768-Bit RSA Modulus. In: Rabin T. (eds) Advances in Cryptology – CRYPTO 2010. CRYPTO 2010. Lecture Notes in Computer Science, vol 6223. Springer, Berlin, Heidelberg

Abstract

This paper reports on the factorization of the 768-bit number RSA-768 by the number field sieve factoring method and discusses some implications for RSA.

Keywords

RSA number field sieve 
Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Thorsten Kleinjung
    • 1
  • Kazumaro Aoki
    • 2
  • Jens Franke
    • 3
  • Arjen K. Lenstra
    • 1
  • Emmanuel Thomé
    • 4
  • Joppe W. Bos
    • 1
  • Pierrick Gaudry
    • 4
  • Alexander Kruppa
    • 4
  • Peter L. Montgomery
    • 5
    • 6
  • Dag Arne Osvik
    • 1
  • Herman te Riele
    • 6
  • Andrey Timofeev
    • 6
  • Paul Zimmermann
    • 4
  1. 1.EPFL IC LACALLausanneSwitzerland
  2. 2.NTTTokyoJapan
  3. 3.Dept. of Math.University of BonnBonnGermany
  4. 4.INRIA CNRS LORIA, Équipe CARAMEL - bâtiment AVillers-lès-Nancy CedexFrance
  5. 5.Microsoft Research, One Microsoft WayRedmondUSA
  6. 6.CWIAmsterdamThe Netherlands

Personalised recommendations