International Conference on the Theory and Application of Cryptology and Information Security

ASIACRYPT 2007: Advances in Cryptology – ASIACRYPT 2007 pp 1-12

A Kilobit Special Number Field Sieve Factorization

  • Kazumaro Aoki
  • Jens Franke
  • Thorsten Kleinjung
  • Arjen K. Lenstra
  • Dag Arne Osvik
Conference paper

DOI: 10.1007/978-3-540-76900-2_1

Volume 4833 of the book series Lecture Notes in Computer Science (LNCS)

Abstract

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− 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.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Kazumaro Aoki
    • 1
  • Jens Franke
    • 2
  • Thorsten Kleinjung
    • 2
  • Arjen K. Lenstra
    • 3
    • 4
  • Dag Arne Osvik
    • 3
  1. 1.NTT, 3-9-11 Midori-cho, Musashino-shi, Tokyo, 180-8585Japan
  2. 2.University of Bonn, Department of Mathematics, Beringstraße 1, D-53115 BonnGermany
  3. 3.EPFL IC LACAL, INJ 330, Station 14, 1015-LausanneSwitzerland
  4. 4.Alcatel-Lucent Bell Laboratories, Murray Hill, NJUSA