Factorization of a 512-bit RSA modulus

  • Authors:
  • Stefania Cavallar;Bruce Dodson;Arjen K. Lenstra;Walter Lioen;Peter L. Montgomery;Brian Murphy;Herman Te Riele;Karen Aardal;Jeff Gilchrist;Gérard Guillerm;Paul Leyland;Joël Marchand;François Morain;Alec Muffett;Chris Putnam;Craig Putnam;Paul Zimmermann

  • Affiliations:
  • CWI, Amsterdam, The Netherlands;Lehigh University, Bethlehem, PA;Citibank, Mendham, NJ;CWI, Amsterdam, The Netherlands;Microsoft Research and CWI, San Rafael, CA;Computer Sciences Laboratory, ANU, Canberra, ACT, Australia;CWI, Amsterdam, The Netherlands;Dept. of Computer Science, Utrecht University, The Netherlands;Entrust Technologies Ltd., Ottawa, ON, Canada;SITX Centre of IT resources, École Polytechnique, Palaiseau, France;Microsoft Research Ltd, Cambridge, UK;Laboratoire Gage, École Polytechnique, CNRS, Palaiseau, France;Laboratoire d'Informatique, École Polytechnique, Palaiseau, France;Sun Microsystems, Riverside Way, Watchmoor Park, Camberley, UK;-;-;Inria Lorraine and Loria, Nancy, France

  • Venue:
  • EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
  • Year:
  • 2000

Quantified Score

Hi-index 0.02

Visualization

Abstract

This paper reports on the factorization of the 512-bit number RSA-155 by the Number Field Sieve factoring method (NFS) and discusses the implications for RSA.