2 search results - page 1 / 1 » Factoring Estimates for a 1024-Bit RSA Modulus |
ASIACRYPT
2003
Springer
13 years 9 months ago
2003
Springer
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...
ACNS
2007
Springer
13 years 10 months ago
2007
Springer
In the RSA system, balanced modulus N denotes a product of two large prime numbers p and q, where q < p < 2q. Since IntegerFactorization is difficult, p and q are simply esti...