Cryptology ePrint Archive: Report 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.

Category / Keywords: factoring

Date: received 4 Aug 2012, last revised 6 Aug 2012

Contact author: gchilders at fullerton edu

Available format(s): PDF | BibTeX Citation

Version: 20120806:230643 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]