Pierrick Gaudry

According to our database1, Pierrick Gaudry authored at least 63 papers between 1999 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields.
IACR Cryptol. ePrint Arch., 2020

Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment.
IACR Cryptol. ePrint Arch., 2020

2019
Improved Complexity Bounds for Counting Points on Hyperelliptic Curves.
Found. Comput. Math., 2019

Breaking the encryption scheme of the Moscow internet voting system.
CoRR, 2019

Imperfect forward secrecy: how Diffie-Hellman fails in practice.
Commun. ACM, 2019

Belenios: A Simple Private and Verifiable Electronic Voting System.
Proceedings of the Foundations of Security, Protocols, and Equational Reasoning, 2019

2018
Verifiability Analysis of CHVote.
IACR Cryptol. ePrint Arch., 2018

Counting points on genus-3 hyperelliptic curves with explicit real multiplication.
CoRR, 2018

2017
Fast Modular Arithmetic on the Kalray MPPA-256 Processor for an Energy-Efficient Implementation of ECM.
IEEE Trans. Computers, 2017

A harmonious encoding of instrument values by a nineteenth-century Parisian violin dealer.
Cryptologia, 2017

2016
Collecting relations for the Number Field Sieve in GF(p6).
IACR Cryptol. ePrint Arch., 2016

A kilobit hidden SNFS discrete logarithm computation.
IACR Cryptol. ePrint Arch., 2016

Improving NFS for the discrete logarithm problem in non-prime finite fields.
IACR Cryptol. ePrint Arch., 2016

Recent progress on the elliptic curve discrete logarithm problem.
Des. Codes Cryptogr., 2016

2015
The Tower Number Field Sieve.
IACR Cryptol. ePrint Arch., 2015

2014
Using Symmetries in the Index Calculus for Elliptic Curves Discrete Logarithm.
J. Cryptology, 2014

Discrete Logarithm in GF(2809) with FFS.
Proceedings of the Public-Key Cryptography - PKC 2014, 2014

Sub-cubic change of ordering for Gröbner basis: a probabilistic approach.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic.
Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

2013
Relation collection for the Function Field Sieve.
IACR Cryptol. ePrint Arch., 2013

A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic.
IACR Cryptol. ePrint Arch., 2013

Discrete logarithm in GF(2809) with FFS.
IACR Cryptol. ePrint Arch., 2013

Polynomial Systems Solving by Fast Linear Algebra
CoRR, 2013

2012
Genus 2 point counting over prime fields.
J. Symb. Comput., 2012

Fast change of ordering with exponent ω.
ACM Commun. Comput. Algebra, 2012

2011
Point Counting.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

An L(1/3) Discrete Logarithm Algorithm for Low Degree Curves.
J. Cryptology, 2011

Counting Points on Genus 2 Curves with Real Multiplication.
IACR Cryptol. ePrint Arch., 2011

Ballot stuffing in a postal voting system.
Proceedings of the 2011 International Workshop on Requirements Engineering for Electronic Voting Systems, 2011

2010
Factorization of a 768-bit RSA modulus.
IACR Cryptol. ePrint Arch., 2010

A Low-Area yet Performant FPGA Implementation of Shabal.
IACR Cryptol. ePrint Arch., 2010

2009
Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem.
J. Symb. Comput., 2009

The arithmetic of characteristic 2 Kummer surfaces and of elliptic Kummer lines.
Finite Fields Their Appl., 2009

An $L (1/3)$ Discrete Logarithm Algorithm for Low Degree Curves
CoRR, 2009

2008
The arithmetic of characteristic 2 Kummer surfaces.
IACR Cryptol. ePrint Arch., 2008

Faster Multiplication in GF(2)[x].
Proceedings of the Algorithmic Number Theory, 8th International Symposium, 2008

Algorithmique des courbes algébriques pour la cryptologie.
, 2008

2007
Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier-Manin Operator.
SIAM J. Comput., 2007

A double large prime variation for small genus hyperelliptic index calculus.
Math. Comput., 2007

An L(1/3 + epsilon) Algorithm for the Discrete Logarithm Problem for Low Degree Curves
CoRR, 2007

A gmp-based implementation of schönhage-strassen's large integer multiplication algorithm.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

An L (1/3 + epsilon ) Algorithm for the Discrete Logarithm Problem for Low Degree Curves.
Proceedings of the Advances in Cryptology, 2007

2006
Evaluation Properties of Symmetric Polynomials.
IJAC, 2006

The Twist-AUgmented Technique for Key Exchange.
Proceedings of the Public Key Cryptography, 2006

Fast algorithms for computing the eigenvalue in the Schoof-Elkies-Atkin algorithm.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

The 2-Adic CM Method for Genus 2 Curves with Application to Cryptography.
Proceedings of the Advances in Cryptology, 2006

2005
Modular equations for hyperelliptic curves.
Math. Comput., 2005

Fast genus 2 arithmetic based on Theta functions.
IACR Cryptol. ePrint Arch., 2005

Key Derivation and Randomness Extraction.
IACR Cryptol. ePrint Arch., 2005

2004
Index calculus for abelian varieties and the elliptic curve discrete logarithm problem.
IACR Cryptol. ePrint Arch., 2004

Construction of Secure Random Curves of Genus 2 over Prime Fields.
Proceedings of the Advances in Cryptology, 2004

A Low-Memory Parallel Version of Matsuo, Chao, and Tsujii?s Algorithm.
Proceedings of the Algorithmic Number Theory, 6th International Symposium, 2004

2003
Counting Points in Medium Characteristic Using Kedlaya's Algorithm.
Experimental Mathematics, 2003

Linear Recurrences with Polynomial Coefficients and Computation of the Cartier-Manin Operator on Hyperelliptic Curves.
Proceedings of the Finite Fields and Applications, 2003

2002
Constructive and Destructive Facets of Weil Descent on Elliptic Curves.
J. Cryptology, 2002

A Comparison and a Combination of SST and AGM Algorithms for Counting Points of Elliptic Curves in Characteristic 2.
Proceedings of the Advances in Cryptology, 2002

2001
Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy.
Proceedings of the Advances in Cryptology, 2001

An Extension of Kedlaya's Point-Counting Algorithm to Superelliptic Curves.
Proceedings of the Advances in Cryptology, 2001

On the Invariants of the Quotients of the Jacobian of a Curve of Genus 2.
Proceedings of the Applied Algebra, 2001

2000
Algorithmique des courbes hyperelliptiques et applications à la cryptologie.
PhD thesis, 2000

An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves.
Proceedings of the Advances in Cryptology, 2000

Counting Points on Hyperelliptic Curves over Finite Fields.
Proceedings of the Algorithmic Number Theory, 4th International Symposium, 2000

1999
Speeding up the Discrete Log Computation on Curves with Automorphisms.
Proceedings of the Advances in Cryptology, 1999


  Loading...