Welcome to the resource topic for 2012/444
Title:
Factorization of a 1061-bit number by the Special Number Field Sieve
Authors: Greg Childers
Abstract:I provide the details of the factorization of the Mersenne number 2^{1061}-1 by the Special Number Field Sieve. Although this factorization is easier than the completed factorization of RSA-768, it represents a new milestone for factorization using publicly available software.
ePrint: https://eprint.iacr.org/2012/444
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 .