A Kilobit Special Number Field Sieve Factorization
- Cite this paper as:
- Aoki K., Franke J., Kleinjung T., Lenstra A.K., Osvik D.A. (2007) A Kilobit Special Number Field Sieve Factorization. In: Kurosawa K. (eds) Advances in Cryptology – ASIACRYPT 2007. ASIACRYPT 2007. Lecture Notes in Computer Science, vol 4833. Springer, Berlin, Heidelberg
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 21039− 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.