CryptoDB
Paul Zimmermann
Publications
Year
Venue
Title
2020
CRYPTO
Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
📺
Abstract
We report on two new records: the factorization of RSA-240, a 795-bit number, and a discrete logarithm computation over a 795-bit prime field. Previous records were the factorization of RSA-768 in 2009 and a 768-bit discrete logarithm computation in 2016. Our two computations at the 795-bit level were done using the same hardware and software, and show that computing a discrete logarithm is not much harder than a factorization of the same size. Moreover, thanks to algorithmic variants and well-chosen parameters, our computations were significantly less expensive than anticipated based on previous records.
The last page of this paper also reports on the factorization of RSA-250.
2010
EPRINT
Factorization of a 768-bit RSA modulus
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.
Coauthors
- Karen Aardal (1)
- Kazumaro Aoki (2)
- Razvan Barbulescu (1)
- Joppe W. Bos (2)
- Fabrice Boudot (1)
- Cyril Bouvier (1)
- Stefania Cavallar (2)
- Jérémie Detrey (1)
- Bruce Dodson (2)
- Jens Franke (2)
- Pierrick Gaudry (4)
- Jeff Gilchrist (1)
- Gérard Guillerm (1)
- Aurore Guillevic (1)
- Nadia Heninger (1)
- Hamza Jeljeli (1)
- Thorsten Kleinjung (2)
- Alexander Kruppa (2)
- Arjen K. Lenstra (4)
- Paul C. Leyland (2)
- Walter M. Lioen (2)
- Joël Marchand (1)
- Peter L. Montgomery (4)
- François Morain (1)
- Alec Muffett (1)
- Brian Murphy (2)
- Dag Arne Osvik (2)
- Chris Putnam (1)
- Craig Putnam (1)
- Herman J. J. te Riele (4)
- Emmanuel Thomé (4)
- Andrey Timofeev (2)
- Marion Videau (1)