"Comparing the Difficulty of Factorization and Discrete Logarithm: A ..."

Fabrice Boudot et al. (2020)

> Home

Details and statistics

DOI: 10.1007/978-3-030-56880-1_3

access: closed

type: Conference or Workshop Paper

metadata version: 2021-10-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/crypto/BoudotGGHTZ20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/crypto/BoudotGGHTZ20
Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, Paul Zimmermann:
Comparing the Difficulty of Factorization and Discrete Logarithm: A 240-Digit Experiment. CRYPTO (2) 2020: 62-91

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.