You are looking at a specific version 20120806:230643 of this paper.
See the latest version.
Paper 2012/444
Factorization of a 1061-bit number by the Special Number Field Sieve
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.
Metadata
- Available format(s)
-
PDF
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- factoring
- Contact author(s)
- gchilders @ fullerton edu
- History
- 2012-08-06: last of 2 revisions
- 2012-08-06: received
- See all versions
- Short URL
- https://ia.cr/2012/444
- License
-
CC BY
