Pierrick Gaudry
Pierrick Gaudry
Overená e-mailová adresa na:
Citované v
Citované v
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
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
Constructive and destructive facets of Weil descent on elliptic curves
P Gaudry, F Hess, NP Smart
Journal of Cryptology 15, 19-46, 2002
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
An algorithm for solving the discrete log problem on hyperelliptic curves
P Gaudry
International Conference on the Theory and Applications of Cryptographic …, 2000
Counting points on hyperelliptic curves over finite fields
P Gaudry, R Harley
International Algorithmic Number Theory Symposium, 313-332, 2000
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
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
Recent progress on the elliptic curve discrete logarithm problem
SD Galbraith, P Gaudry
Designs, Codes and Cryptography 78, 51-72, 2016
A general framework for subexponential discrete logarithm algorithms
A Enge, P Gaudry
Acta Arithmetica 102, 83-103, 2002
Fast genus 2 arithmetic based on Theta functions
P Gaudry
Journal of Mathematical Cryptology 1 (3), 243-265, 2007
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
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
Genus 2 point counting over prime fields
P Gaudry, É Schost
Journal of Symbolic Computation 47 (4), 368-400, 2012
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
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
Construction of secure random curves of genus 2 over prime fields
P Gaudry, É Schost
Advances in Cryptology-EUROCRYPT 2004: International Conference on the …, 2004
Faster Multiplication in GF(2)[x]
RP Brent, P Gaudry, E Thomé, P Zimmermann
Algorithmic Number Theory: 8th International Symposium, ANTS-VIII Banff …, 2008
The tower number field sieve
R Barbulescu, P Gaudry, T Kleinjung
International Conference on the Theory and Application of Cryptology and …, 2015
An extension of Kedlaya’s point-counting algorithm to superelliptic curves
P Gaudry, N Gürel
Advances in Cryptology—ASIACRYPT 2001: 7th International Conference on the …, 2001
Systém momentálne nemôže vykonať operáciu. Skúste to neskôr.
Články 1–20