Factoring estimates for a 1024-bit RSA modulus
Tromer, E.; Shamir, A.; Kortsmit, W.; Dodson, B.; Hughes, J.; Leyland, P.; Lenstra, Arjen K.
2003

Files

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].

Details

Title Factoring estimates for a 1024-bit RSA modulus
Author(s) Tromer, E. ; Shamir, A. ; Kortsmit, W. ; Dodson, B. ; Hughes, J. ; Leyland, P. ; Lenstra, Arjen K.
Published in Advances In Cryptology - Asiacrypt 2003
Series Lecture Notes In Computer Science, 2894
Pages 55-74
Conference 9th International Conference on the Theory and Application of Cryptology and Information Security, TAIPEI, TAIWAN, Nov 30-Dec 04, 2003
Date 2003
Publisher Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa
Keywords
DOI https://doi.org/10.1007/978-3-540-40061-5_4
Laboratories LACAL
Record Appears in Scientific production and competences > I&C - School of Computer and Communication Sciences > IINFCOM > LACAL - Laboratory for cryptologic algorithms
Peer-reviewed publications
Work outside EPFL
Conference Papers
Published
Record creation date 2011-03-29

Actions

Preview