Obserwuj
Emmanuel Thomé
Emmanuel Thomé
INRIA Nancy
Zweryfikowany adres z inria.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
6572015
Factorization of a 768-Bit RSA Modulus.
T Kleinjung, K Aoki, J Franke, AK Lenstra, E Thomé, JW Bos, P Gaudry, ...
Crypto 6223, 333-350, 2010
6512010
A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic
R Barbulescu, P Gaudry, A Joux, E Thomé
Advances in Cryptology–EUROCRYPT 2014: 33rd Annual International Conference …, 2014
3762014
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
2002007
Faster Multiplication in GF(2)[x]
RP Brent, P Gaudry, E Thomé, P Zimmermann
Algorithmic Number Theory: 8th International Symposium, ANTS-VIII Banff …, 2008
812008
Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm
E Thomé
Journal of symbolic computation 33 (5), 757-775, 2002
772002
Computation of Discrete Logarithms in\ mathbb {F} _ {2^{607}}
E Thomé
Advances in Cryptology—ASIACRYPT 2001, 107-124, 2001
662001
The mpFq library and implementing curve-based key exchanges
P Gaudry, E Thomé
SPEED: software performance enhancement for encryption and decryption, 49-64, 2007
652007
A kilobit hidden SNFS discrete logarithm computation
J Fried, P Gaudry, N Heninger, E Thomé
Advances in Cryptology–EUROCRYPT 2017: 36th Annual International Conference …, 2017
642017
Index calculus in class groups of non-hyperelliptic curves of genus three
C Diem, E Thomé
Journal of Cryptology 21 (4), 593-611, 2008
472008
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
442020
Discrete Logarithm in GF (2809) with FFS.
R Barbulescu, C Bouvier, J Detrey, P Gaudry, H Jeljeli, E Thomé, ...
Public Key Cryptography, 221-238, 2014
422014
When e-th Roots Become Easier Than Factoring
A Joux, D Naccache, E Thomé
Advances in Cryptology–ASIACRYPT 2007: 13th International Conference on the …, 2007
362007
Cocks–Pinch curves of embedding degrees five to eight and optimal ate pairing computation
A Guillevic, S Masson, E Thomé
Designs, Codes and Cryptography 88 (6), 1047-1081, 2020
352020
An L (1/3) discrete logarithm algorithm for low degree curves
A Enge, P Gaudry, E Thomé
Journal of Cryptology 24 (1), 24-41, 2011
302011
Fast computation of linear generators for matrix sequences and application to the block Wiedemann algorithm
E Thomé
Proceedings of the 2001 international symposium on symbolic and algebraic …, 2001
302001
Computing class polynomials for abelian surfaces
A Enge, E Thomé
Experimental Mathematics 23 (2), 129-145, 2014
262014
Oracle-assisted static Diffie-Hellman is easier than discrete logarithms
A Joux, R Lercier, D Naccache, E Thomé
Cryptography and Coding: 12th IMA International Conference, Cryptography and …, 2009
242009
Algorithmes de calcul de logarithmes discrets dans les corps finis.
E Thomé
École Polytechnique, Palaiseau, France, 2003
242003
A heterogeneous computing environment to solve the 768-bit RSA challenge
T Kleinjung, JW Bos, AK Lenstra, DA Osvik, K Aoki, S Contini, J Franke, ...
Cluster Computing 15, 53-68, 2012
232012
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20