Factoring estimates for a 1024-bit RSA modulus

A.K. Lenstra, E. Tromer, A. Shamir, W.J.P.M. Kortsmit, B. Dodson, J. Hughes, P. Leyland

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

34 Citations (Scopus)
1 Downloads (Pure)


We estimate the yield of the number field sieve factoring algorithm when applied to the 1024-bit composite integer RSA-1024 and the parameters as proposed in the draft version [17] of the TWIRL hardware factoring device [18]. We present the details behind the resulting improved parameter choices from [18].
Original languageEnglish
Title of host publicationAdvances in Cryptology (Asiacrypt 2003, Taipei, Taiwan, November 30-December 4, 2003)
EditorsChi Sung Laih
Place of PublicationBerlin
ISBN (Print)3-540-20592-6
Publication statusPublished - 2003

Publication series

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


Dive into the research topics of 'Factoring estimates for a 1024-bit RSA modulus'. Together they form a unique fingerprint.

Cite this