CryptoDB
Factorization of a 768-bit RSA modulus
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2010-22907, title={Factorization of a 768-bit RSA modulus}, booktitle={IACR Eprint archive}, keywords={public-key cryptography / RSA, number field sieve}, url={http://eprint.iacr.org/2010/006}, note={to be submitted akl@epfl.ch 14658 received 6 Jan 2010, last revised 18 Feb 2010}, author={Thorsten Kleinjung and Kazumaro Aoki and Emmanuel Thomé and Jens Franke and Arjen Lenstra 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}, year=2010 }