Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2020

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.
Fichier principal
Vignette du fichier
paper.pdf (602.26 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02863525 , version 1 (10-06-2020)
hal-02863525 , version 2 (17-08-2020)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook X LinkedIn More