@inproceedings{df246c5faca34494837db4cd67599347,
title = "Factoring estimates for a 1024-bit RSA modulus",
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].",
author = "A.K. Lenstra and E. Tromer and A. Shamir and W.J.P.M. Kortsmit and B. Dodson and J. Hughes and P. Leyland",
year = "2003",
doi = "10.1007/978-3-540-40061-5_4",
language = "English",
isbn = "3-540-20592-6",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "55--74",
editor = "Laih, {Chi Sung}",
booktitle = "Advances in Cryptology (Asiacrypt 2003, Taipei, Taiwan, November 30-December 4, 2003)",
address = "Germany",
}