Factoring estimates for a 1024-Bit RSA modulus

Arjen Lenstra, Eran Tromer, Adi Shamir, Wil Kortsmit, Bruce Dodson, James Hughes, Paul Leyland

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

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 publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsChi Sung Laih
PublisherSpringer Verlag
Pages55-74
Number of pages20
ISBN (Print)3540205926
DOIs
StatePublished - 2003
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2894
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Keywords

  • 024-bit RSA
  • Factorization
  • Number field sieve
  • TWIRL

Fingerprint

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

Cite this