Factorization of a 512-bit RSA modulus

S. Cavallar, B. Dodson, A.K. Lenstra, W.M. Lioen, P.L. Montgomery, B. Murphy, H.J.J. Riele, te

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

62 Citations (Scopus)

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. Breakdown of individual contributions to this project: Management: Te Riele; polynomial selection algorithm: Montgomery, Murphy; polynomial selection computations: Dodson, Lenstra, Montgomery, Murphy; sieving codes: Lenstra, Montgomery; sieving: Aardal, Cavallar, Dodson, Gilchrist, Guillerm, Lenstra, Leyland, Lioen, Marchand, Montgomery, Morain, Muffett, Putnam, Zimmermann; filtering: Cavallar, Montgomery; linear algebra: Leyland, Montgomery; square root: Montgomery; data collection, analysis of data and running the NFS code at CWI and SARA: Cavallar, Lioen, Montgomery; technical support: Lioen
Original languageEnglish
Title of host publicationAdvances in Cryptology - EUROCRYPT 2000 (Proceedings International Conference on the Theory and Application of Cryptographic Techniques, Bruges, Belgium, May 14-18, 2000)
EditorsB. Preneel
Place of PublicationBerlin
PublisherSpringer
Pages1-18
ISBN (Print)3-540-67517-5
DOIs
Publication statusPublished - 2000

Publication series

NameLecture Notes in Computer Science
Volume1807
ISSN (Print)0302-9743

Fingerprint Dive into the research topics of 'Factorization of a 512-bit RSA modulus'. Together they form a unique fingerprint.

Cite this