conference paper
Factoring estimates for a 1024-bit RSA modulus
2003
Advances In Cryptology - Asiacrypt 2003
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].
Type
conference paper
Author(s)
Date Issued
2003
Published in
Advances In Cryptology - Asiacrypt 2003
Series title/Series vol.
Lecture Notes In Computer Science; 2894
Start page
55
End page
74
Subjects
Editorial or Peer reviewed
REVIEWED
Written at
OTHER
EPFL units
| Event name | Event place | Event date |
TAIPEI, TAIWAN | Nov 30-Dec 04, 2003 | |
Available on Infoscience
March 29, 2011
Use this identifier to reference this record