| HAL-Inria | Publications, software ... of Inria's scientists |
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.
Cited literature [37 references]
https://hal.inria.fr/hal-02863525
Contributor : Aurore Guillevic Connect in order to contact the contributor
Submitted on : Monday, August 17, 2020 - 4:04:03 PM
Last modification on : Friday, February 4, 2022 - 3:25:43 AM
Contributor : Aurore Guillevic Connect in order to contact the contributor
Submitted on : Monday, August 17, 2020 - 4:04:03 PM
Last modification on : Friday, February 4, 2022 - 3:25:43 AM
File
paper.pdf
Files produced by the author(s)