Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment (original) (raw)

Dates et versions

hal-02863525 , version 1 (10-06-2020)

hal-02863525 , version 2 (17-08-2020)

Licence

Identifiants

• HAL Id : hal-02863525 , version 2
• DOI : 10.1007/978-3-030-56880-1_3

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. 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⟩