Obserwuj
Pierrick Gaudry
Pierrick Gaudry
Zweryfikowany adres z loria.fr
Tytuł
Cytowane przez
Cytowane przez
Rok
Imperfect forward secrecy: How Diffie-Hellman fails in practice
D Adrian, K Bhargavan, Z Durumeric, P Gaudry, M Green, JA Halderman, ...
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications …, 2015
7742015
Factorization of a 768-bit RSA modulus
T Kleinjung, K Aoki, J Franke, AK Lenstra, E Thomé, JW Bos, P Gaudry, ...
Advances in Cryptology–CRYPTO 2010: 30th Annual Cryptology Conference, Santa …, 2010
7092010
Constructive and destructive facets of Weil descent on elliptic curves
P Gaudry, F Hess, NP Smart
Journal of Cryptology 15, 19-46, 2002
4732002
A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic
R Barbulescu, P Gaudry, A Joux, E Thomé
Annual International Conference on the Theory and Applications of …, 2014
3942014
An algorithm for solving the discrete log problem on hyperelliptic curves
P Gaudry
International Conference on the Theory and Applications of Cryptographic …, 2000
3022000
Counting points on hyperelliptic curves over finite fields
P Gaudry, R Harley
International Algorithmic Number Theory Symposium, 313-332, 2000
2282000
Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
P Gaudry
Journal of Symbolic computation 44 (12), 1690-1702, 2009
209*2009
A double large prime variation for small genus hyperelliptic index calculus
P Gaudry, E Thomé, N Thériault, C Diem
Mathematics of computation 76 (257), 475-492, 2007
2072007
Recent progress on the elliptic curve discrete logarithm problem
SD Galbraith, P Gaudry
Designs, Codes and Cryptography 78, 51-72, 2016
1772016
Fast genus 2 arithmetic based on Theta functions
P Gaudry
Journal of Mathematical Cryptology 1 (3), 243-265, 2007
1622007
A general framework for subexponential discrete logarithm algorithms
A Enge, P Gaudry
Acta Arithmetica 102, 83-103, 2002
1612002
Speeding up the discrete log computation on curves with automorphisms
I Duursma, P Gaudry, F Morain
Advances in Cryptology-ASIACRYPT’99: International Conference on the Theory …, 1999
1311999
An extension of Satoh's algorithm and its implementation
M Fouquet, P Gaudry, R Harley
Journal of the Ramanujan Mathematical Society 15, 281-318, 2000
1292000
Genus 2 point counting over prime fields
P Gaudry, É Schost
Journal of Symbolic Computation 47 (4), 368-400, 2012
1132012
Linear recurrences with polynomial coefficients and application to integer factorization and Cartier–Manin operator
A Bostan, P Gaudry, É Schost
SIAM Journal on Computing 36 (6), 1777-1806, 2007
1132007
Improving NFS for the discrete logarithm problem in non-prime finite fields
R Barbulescu, P Gaudry, A Guillevic, F Morain
Annual International Conference on the Theory and Applications of …, 2015
992015
Belenios: a simple private and verifiable electronic voting system
V Cortier, P Gaudry, S Glondu
Foundations of Security, Protocols, and Equational Reasoning: Essays …, 2019
952019
Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
F Boudot, P Gaudry, A Guillevic, N Heninger, E Thomé, P Zimmermann
Advances in Cryptology–CRYPTO 2020: 40th Annual International Cryptology …, 2020
942020
Faster Multiplication in GF(2)[x]
RP Brent, P Gaudry, E Thomé, P Zimmermann
Algorithmic Number Theory: 8th International Symposium, ANTS-VIII Banff …, 2008
932008
Construction of secure random curves of genus 2 over prime fields
P Gaudry, É Schost
Advances in Cryptology-EUROCRYPT 2004: International Conference on the …, 2004
932004
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20