Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment - Publications from users of the SILECS research infrastructure Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment

Résumé

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 (380.25 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

  • HAL Id : hal-02863525 , version 1

Citer

Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, et al.. Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment. The 40th Annual International Cryptology Conference (Crypto 2020), Aug 2020, Santa Barbara, USA, United States. ⟨hal-02863525v1⟩
567 Consultations
479 Téléchargements

Partager

Gmail Facebook X LinkedIn More