Tromer, E.Shamir, A.Kortsmit, W.Dodson, B.Hughes, J.Leyland, P.Lenstra, Arjen K.2011-03-292011-03-292011-03-29200310.1007/978-3-540-40061-5_4https://infoscience.epfl.ch/handle/20.500.14299/65743We 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].1024-bit RSAfactorizationnumber field sieveTwirlFactorizationtext::conference output::conference proceedings::conference paper