Factorization of a 1061-bit number by the Special Number Field Sieve.
Greg Childers · IACR Cryptology ePrint Archive · 2012
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. 1