Welcome to the resource topic for 2020/697
Title:
Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
Authors: F. Boudot, P. Gaudry, A. Guillevic, N. Heninger, E. Thomé, P. Zimmermann
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.
ePrint: https://eprint.iacr.org/2020/697
Talk: https://www.youtube.com/watch?v=Qk207A4H7kU
Slides: https://iacr.org/submit/files/slides/2020/crypto/crypto2020/79/slides.pdf
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .