Pierrick Gaudry

From MaRDI portal
Person:412198

Available identifiers

zbMath Open gaudry.pierrickMaRDI QIDQ412198

List of research outcomes





PublicationDate of PublicationType
Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation2024-01-23Paper
Counting points on genus-3 hyperelliptic curves with explicit real multiplication2023-08-02Paper
Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation2023-05-12Paper
Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields2022-11-09Paper
Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment2022-11-09Paper
Belenios: a simple private and verifiable electronic voting system2020-03-03Paper
Improved complexity bounds for counting points on hyperelliptic curves2019-06-06Paper
Fast Modular Arithmetic on the Kalray MPPA-256 Processor for an Energy-Efficient Implementation of ECM2018-06-27Paper
A Kilobit Hidden SNFS Discrete Logarithm Computation2017-06-13Paper
Collecting relations for the number field sieve in2017-04-04Paper
Fast algorithms for computing the eigenvalue in the Schoof-Elkies-Atkin algorithm2017-02-03Paper
The Tower Number Field Sieve2016-03-23Paper
Recent progress on the elliptic curve discrete logarithm problem2016-02-02Paper
Sub-cubic change of ordering for Gröbner basis2015-11-11Paper
Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields2015-09-30Paper
Using symmetries in the index calculus for elliptic curves discrete logarithm2015-01-07Paper
Improvements to the number field sieve for non-prime finite fields2014-08-04Paper
https://portal.mardi4nfdi.de/entity/Q49816862014-06-24Paper
A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic2014-05-27Paper
Discrete Logarithm in GF(2809) with FFS2014-03-25Paper
https://portal.mardi4nfdi.de/entity/Q53001052013-06-26Paper
A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic2013-06-18Paper
Genus 2 point counting over prime fields2012-05-04Paper
Counting Points on Genus 2 Curves with Real Multiplication2011-12-02Paper
An \(L(1/3)\) discrete logarithm algorithm for low degree curves2011-04-01Paper
A Low-Area Yet Performant FPGA Implementation of Shabal2011-03-15Paper
Factorization of a 768-Bit RSA Modulus2010-08-24Paper
Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem2009-10-16Paper
The arithmetic of characteristic 2 Kummer surfaces and of elliptic Kummer lines2009-04-08Paper
https://portal.mardi4nfdi.de/entity/Q53016662009-01-20Paper
Faster Multiplication in GF(2)[x]2008-05-27Paper
Fast genus 2 arithmetic based on Theta functions2008-02-21Paper
Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator2008-01-03Paper
An L (1/3 + ε) Algorithm for the Discrete Logarithm Problem for Low Degree Curves2007-11-29Paper
Advances in Cryptology - EUROCRYPT 20042007-09-25Paper
Public Key Cryptography - PKC 20062007-05-02Paper
A double large prime variation for small genus hyperelliptic index calculus2007-02-02Paper
EVALUATION PROPERTIES OF SYMMETRIC POLYNOMIALS2006-08-14Paper
https://portal.mardi4nfdi.de/entity/Q33748962006-03-01Paper
Algorithmic Number Theory2005-08-12Paper
Counting Points in Medium Characteristic Using Kedlaya's Algorithm2005-02-21Paper
https://portal.mardi4nfdi.de/entity/Q48322762005-01-04Paper
Modular equations for hyperelliptic curves2004-10-07Paper
https://portal.mardi4nfdi.de/entity/Q44742732004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44741942004-08-04Paper
A Comparison and a Combination of SST and AGM Algorithms for Counting Points of Elliptic Curves in Characteristic 22003-07-16Paper
An extension of Satoh's algorithm and its implementation2003-05-01Paper
https://portal.mardi4nfdi.de/entity/Q27394532003-03-06Paper
https://portal.mardi4nfdi.de/entity/Q31496702002-09-30Paper
Constructive and destructive facets of Weil descent on elliptic curves2002-05-21Paper
A general framework for subexponential discrete logarithm algorithms2002-03-20Paper
https://portal.mardi4nfdi.de/entity/Q45024912001-01-04Paper

Research outcomes over time

This page was built for person: Pierrick Gaudry