Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [37 references]  Display  Hide  Download

https://hal.inria.fr/hal-02863525
Contributor : Aurore Guillevic <>
Submitted on : Monday, August 17, 2020 - 4:04:03 PM
Last modification on : Friday, October 16, 2020 - 4:02:02 PM

File

paper.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, et al.. Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment. CRYPTO, Aug 2020, Santa Barbara CA, United States. pp.62-91, ⟨10.1007/978-3-030-56880-1_3⟩. ⟨hal-02863525v2⟩

Share

Metrics

Record views

144

Files downloads

292