"Asymptotic Complexities of Discrete Logarithm Algorithms in ..."

Gabrielle De Micheli, Pierrick Gaudry, Cécile Pierrot (2020)

> Home

Details and statistics

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

access: closed

type: Conference or Workshop Paper

metadata version: 2020-10-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/crypto/MicheliGP20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/crypto/MicheliGP20
Gabrielle De Micheli, Pierrick Gaudry, Cécile Pierrot:
Asymptotic Complexities of Discrete Logarithm Algorithms in Pairing-Relevant Finite Fields. CRYPTO (2) 2020: 32-61

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.