Pierrick Gaudry

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Gabrielle De Micheli

> Home > Persons > Pierrick Gaudry

Publications

2024
[j21]
- view
  authority control:
- export record
  dblp key:
  - journals/joc/MicheliGP24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/joc/MicheliGP24
Gabrielle De Micheli, Pierrick Gaudry, Cécile Pierrot:
Lattice Enumeration and Automorphisms for Tower NFS: A 521-Bit Discrete Logarithm Computation. J. Cryptol. 37(1): 6 (2024)
2021
[c33]
- view
  authority control:
- export record
  dblp key:
  - conf/asiacrypt/MicheliGP21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/asiacrypt/MicheliGP21
Gabrielle De Micheli, Pierrick Gaudry, Cécile Pierrot:
Lattice Enumeration for Tower NFS: A 521-Bit Discrete Logarithm Computation. ASIACRYPT (1) 2021: 67-96
[i32]
- view
  - electronic edition @ iacr.org (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/iacr/MicheliGP21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iacr/MicheliGP21
Gabrielle De Micheli, Pierrick Gaudry, Cécile Pierrot:
Lattice Enumeration for Tower NFS: a 521-bit Discrete Logarithm Computation. IACR Cryptol. ePrint Arch. 2021: 707 (2021)
2020
[c32]
- view
  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
[i30]
- view
  - electronic edition @ iacr.org (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/iacr/MicheliGP20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iacr/MicheliGP20
Gabrielle De Micheli, Pierrick Gaudry, Cécile Pierrot:
Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields. IACR Cryptol. ePrint Arch. 2020: 329 (2020)

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.