1. Factoring estimates for a 1024-bit RSA modulus
- Author
-
Lenstra, A.K., Tromer, E., Shamir, A., Kortsmit, W.J.P.M., Dodson, B., Hughes, J., Leyland, P., Laih, Chi Sung, Discrete Mathematics, and Coding Theory and Cryptology
- Subjects
1024-bit RSA ,business.industry ,number field sieve ,Cryptography ,Algebraic number field ,General number field sieve ,Public-key cryptography ,TWIRL ,Twirl ,Factoring ,Factorization ,factorization ,Arithmetic ,business ,Algorithm ,Mathematics ,Integer (computer science) - 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].
- Published
- 2003
- Full Text
- View/download PDF