Factorization of a 768-bit RSA modulus

  • Authors:
  • 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

  • Affiliations:
  • EPFL, IC LACAL, Lausanne, Switzerland;NTT, Musashino-shi, Tokyo, Japan;University of Bonn, Dept. of Math., Bonn, Germany;EPFL, IC LACAL, Lausanne, Switzerland;INRIA, CNRS, LORIA, Équipe CARAMEL, Villers-lès-Nancy Cedex, France;EPFL, IC LACAL, Lausanne, Switzerland;INRIA, CNRS, LORIA, Équipe CARAMEL, Villers-lès-Nancy Cedex, France;INRIA, CNRS, LORIA, Équipe CARAMEL, Villers-lès-Nancy Cedex, France;Microsoft Research, Redmond, WA and CWI, Amsterdam, The Netherlands;EPFL, IC LACAL, Lausanne, Switzerland;CWI, Amsterdam, The Netherlands;CWI, Amsterdam, The Netherlands;INRIA, CNRS, LORIA, Équipe CARAMEL, Villers-lès-Nancy Cedex, France

  • Venue:
  • CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
  • Year:
  • 2010

Quantified Score

Hi-index 0.02

Visualization

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.