Loading...
conference paper
A kilobit special number field sieve factorization
2007
Lecture Notes in Computer Science
We describe how we reached a new factoring milestone by completing the first special number field sieve factorization of a number having more than 1024 bits, namely the Mersenne number 2<sup>1039</sup> -1. Although this factorization is orders of magnitude 'easier' than a factorization of a 1024-bit RSA modulus is believed to be, the methods we used to obtain our result shed new light on the feasibility of the latter computation. © International Association for Cryptology Research 2007.
Loading...
Name
EPFL-CONF-149459.pdf
Access type
openaccess
Size
373.03 KB
Format
Adobe PDF
Checksum (MD5)
584a3731e19dfb4a6813db659ac86e8d