A Kilobit Special Number Field Sieve Factorization

13 years 8 months ago

Download eprint.iacr.org

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 21039

Kazumaro Aoki, Jens Franke, Thorsten Kleinjung, Ar

Real-time Traffic

ASIACRYPT 2007 | Cryptology | Special Number Field Sieve |

claim paper

» On Class Group Computations Using the Number Field Sieve

» Using number fields to compute logarithms in finite fields

» Analysis and Optimization of the TWINKLE Factoring Device

» The Number Field Sieve

» Improved RoutingBased Linear Algebra for the Number Field Sieve

» The number field sieve for integers of low weight

» Designing and Detecting Trapdoors for Discrete Log Cryptosystems

» NonwaferScale Sieving Hardware for the NFS Another Attempt to Cope with 1024Bit

Post Info
More Details (n/a)

Added	12 Aug 2010
Updated	12 Aug 2010
Type	Conference
Year	2007
Where	ASIACRYPT
Authors	Kazumaro Aoki, Jens Franke, Thorsten Kleinjung, Arjen K. Lenstra, Dag Arne Osvik

Comments (0)

Sciweavers

A Kilobit Special Number Field Sieve Factorization

ASIACRYPT 2007 | Cryptology | Special Number Field Sieve |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers