A kilobit special number field sieve factorization

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<sup>1039</sup> -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. &copy; International Association for Cryptology Research 2007.


Published in:
Lecture Notes in Computer Science, 4833, 1 - 12
Presented at:
ASIACRYPT 2007, Kuching, Malaysia
Year:
2007
ISSN:
03029743
Keywords:
Laboratories:




 Record created 2010-06-24, last modified 2018-03-17

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)