Chapter

Advances in Cryptology – CRYPTO 2010

Volume 6223 of the series Lecture Notes in Computer Science pp 333-350

Factorization of a 768-Bit RSA Modulus

  • Thorsten KleinjungAffiliated withEPFL IC LACAL
  • , Kazumaro AokiAffiliated withNTT
  • , Jens FrankeAffiliated withDept. of Math., University of Bonn
  • , Arjen K. LenstraAffiliated withEPFL IC LACAL
  • , Emmanuel ThoméAffiliated withINRIA CNRS LORIA, Équipe CARAMEL - bâtiment A
  • , Joppe W. BosAffiliated withEPFL IC LACAL
  • , Pierrick GaudryAffiliated withINRIA CNRS LORIA, Équipe CARAMEL - bâtiment A
  • , Alexander KruppaAffiliated withINRIA CNRS LORIA, Équipe CARAMEL - bâtiment A
  • , Peter L. MontgomeryAffiliated withMicrosoft Research, One Microsoft WayCWI
    • , Dag Arne OsvikAffiliated withEPFL IC LACAL
    • , Herman te RieleAffiliated withCWI
    • , Andrey TimofeevAffiliated withCWI
    • , Paul ZimmermannAffiliated withINRIA CNRS LORIA, Équipe CARAMEL - bâtiment A

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