Sciweavers

Share
ASIACRYPT
2003
Springer

Factoring Estimates for a 1024-Bit RSA Modulus

12 years 5 months ago
Factoring Estimates for a 1024-Bit RSA Modulus
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].
Arjen K. Lenstra, Eran Tromer, Adi Shamir, Wil Kor
Added 06 Jul 2010
Updated 06 Jul 2010
Type Conference
Year 2003
Where ASIACRYPT
Authors Arjen K. Lenstra, Eran Tromer, Adi Shamir, Wil Kortsmit, Bruce Dodson, James Hughes, Paul C. Leyland
Comments (0)
books