Factorization of a 768-bit RSA modulus

Thorsten Kleinjung; Kazumaro Aoki; Jens Franke; Arjen Lenstra; Emmanuel Thomé; Joppe Bos; Pierrick Gaudry; Alexander Kruppa; Peter Montgomery; Dag Arne Osvik; Herman te Riele; Andrey Timofeev; Paul Zimmermann

Paper 2010/006 Original: eprint.iacr.org/2010/006 ↗

Factorization of a 768-bit RSA modulus

Thorsten Kleinjung

Kazumaro Aoki

Jens Franke

Arjen Lenstra

Emmanuel Thomé

Joppe Bos

Pierrick Gaudry

Alexander Kruppa

Peter Montgomery

Dag Arne Osvik

Herman te Riele

Andrey Timofeev

Paul Zimmermann

Abstract

This paper reports on the factorization of the 768-bit number RSA-768 by the number field sieve factoring method and discusses some implications for RSA.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Preprint.
History: 2010-02-18: last updated; 2010-01-07: published
Short URL: https://ia.cr/2010/006
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2010/006,
      author = {Thorsten Kleinjung and Kazumaro Aoki and Jens Franke and Arjen Lenstra and Emmanuel Thomé and Joppe Bos and Pierrick Gaudry and Alexander Kruppa and Peter Montgomery and Dag Arne Osvik and Herman te Riele and Andrey Timofeev and Paul Zimmermann},
      title = {Factorization of a 768-bit RSA modulus},
      howpublished = {Cryptology {ePrint} Archive, Paper 2010/006},
      year = {2010},
      url = {https://eprint.iacr.org/2010/006}
}