Abstract
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. © International Association for Cryptology Research 2007.
Cite
CITATION STYLE
Aoki, K., Franke, J., Kleinjung, T., Lenstra, A. K., & Osvik, D. A. (2007). A kilobit special number field sieve factorization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4833 LNCS, pp. 1–12). Springer Verlag. https://doi.org/10.1007/978-3-540-76900-2_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
