Welcome to the resource topic for 2007/205
Title:
A kilobit special number field sieve factorization
Authors: Kazumaro Aoki, Jens Franke, Thorsten Kleinjung, Arjen Lenstra, Dag Arne Osvik
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 2^{1039}-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.
ePrint: https://eprint.iacr.org/2007/205
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .