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].
Title
Factoring estimates for a 1024-bit RSA modulus
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
Record creation date
2011-03-29