×

zbMATH — the first resource for mathematics

Thomé, Emmanuel

Compute Distance To:
Author ID: thome.emmanuel Recent zbMATH articles by "Thomé, Emmanuel"
Published as: Thomé, E.; Thomé, Emmanuel
External Links: MGP · Wikidata
Documents Indexed: 28 Publications since 2001, including 1 Book

Publications by Year

Citations contained in zbMATH

24 Publications have been cited 178 times in 132 Documents Cited by Year
A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic. Zbl 1326.11080
Barbulescu, Razvan; Gaudry, Pierrick; Joux, Antoine; Thomé, Emmanuel
40
2014
A double large prime variation for small genus hyperelliptic index calculus. Zbl 1179.94062
Gaudry, P.; Thomé, E.; Thériault, N.; Diem, C.
36
2007
Factorization of a 768-bit RSA modulus. Zbl 1196.11167
Kleinjung, Thorsten; Aoki, Kazumaro; Franke, Jens; Lenstra, Arjen K.; Thomé, Emmanuel; Bos, Joppe W.; Gaudry, Pierrick; Kruppa, Alexander; Montgomery, Peter L.; Osvik, Dag Arne; te Riele, Herman; Timofeev, Andrey; Zimmermann, Paul
23
2010
Index calculus in class groups of non-hyperelliptic curves of genus three. Zbl 1167.11047
Diem, Claus; Thomé, Emmanuel
10
2008
A kilobit hidden SNFS discrete logarithm computation. Zbl 1411.11134
Fried, Joshua; Gaudry, Pierrick; Heninger, Nadia; Thomé, Emmanuel
6
2017
Computing class polynomials for abelian surfaces. Zbl 1293.11107
Enge, Andreas; Thomé, Emmanuel
6
2014
Discrete logarithm in \(\mathrm{GF}(2^{809})\) with FFS. Zbl 1335.94029
Barbulescu, Razvan; Bouvier, Cyril; Detrey, Jérémie; Gaudry, Pierrick; Jeljeli, Hamza; Thomé, Emmanuel; Videau, Marion; Zimmermann, Paul
6
2014
An \(L(1/3)\) discrete logarithm algorithm for low degree curves. Zbl 1208.94042
Enge, Andreas; Gaudry, Pierrick; Thomé, Emmanuel
6
2011
Faster multiplication in \(\text{GF}(2)[x]\). Zbl 1230.11152
Brent, Richard P.; Gaudry, Pierrick; Thomé, Emmanuel; Zimmermann, Paul
6
2008
Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm. Zbl 1010.65024
Thomé, Emmanuel
5
2002
Computation of discrete logarithms in \(\mathbb {F}_{2^{607}}\). Zbl 1062.11080
Thomé, Emmanuel
5
2001
When \(e\)-th roots become easier than factoring. Zbl 1153.11345
Joux, Antoine; Naccache, David; Thomé, Emmanuel
4
2007
Root optimization of polynomials in the number field sieve. Zbl 1378.11104
Bai, Shi; Brent, Richard P.; Thomé, Emmanuel
3
2015
Computation with no memory, and rearrangeable multicast networks. Zbl 1291.90041
Burckel, Serge; Gioan, Emeric; Thomé, Emmanuel
3
2014
Oracle-assisted static Diffie-Hellman is easier than discrete logarithms. Zbl 1234.94050
Joux, Antoine; Lercier, Reynald; Naccache, David; Thomé, Emmanuel
3
2009
Fast computation of linear generators for matrix sequences and application to the block Wiedemann algorithm. Zbl 1356.68296
Thomé, Emmanuel
3
2001
Solving discrete logarithms on a 170-bit MNT curve by pairing reduction. Zbl 1418.11159
Guillevic, Aurore; Morain, François; Thomé, Emmanuel
2
2017
Linear time interactive certificates for the minimal polynomial and the determinant of a sparse matrix. Zbl 1365.65138
Dumas, Jean-Guillaume; Kaltofen, Erich; Thomé, Emmanuel; Villard, Gilles
2
2016
Computing theta functions in quasi-linear time in genus two and above. Zbl 1361.14028
Labrande, Hugo; Thomé, Emmanuel
2
2016
Square root algorithms for the number field sieve. Zbl 1298.11114
Thomé, Emmanuel
2
2012
Mapping computation with no memory. Zbl 1253.68125
Burckel, Serge; Gioan, Emeric; Thomé, Emmanuel
2
2009
Fast integer multiplication using generalized Fermat primes. Zbl 1412.68304
Covanov, Svyatoslav; Thomé, Emmanuel
1
2019
Computing discrete logarithms in \(\mathbb F_{p^6}\). Zbl 1384.94066
Grémy, Laurent; Guillevic, Aurore; Morain, François; Thomé, Emmanuel
1
2018
Algorithmic number theory. 9th international symposium, ANTS-IX, Nancy, France, July 19–23, 2010. Proceedings. Zbl 1196.11006
Hanrot, Guillaume (ed.); Morain, François (ed.); Thomé, Emmanuel (ed.)
1
2010
Fast integer multiplication using generalized Fermat primes. Zbl 1412.68304
Covanov, Svyatoslav; Thomé, Emmanuel
1
2019
Computing discrete logarithms in \(\mathbb F_{p^6}\). Zbl 1384.94066
Grémy, Laurent; Guillevic, Aurore; Morain, François; Thomé, Emmanuel
1
2018
A kilobit hidden SNFS discrete logarithm computation. Zbl 1411.11134
Fried, Joshua; Gaudry, Pierrick; Heninger, Nadia; Thomé, Emmanuel
6
2017
Solving discrete logarithms on a 170-bit MNT curve by pairing reduction. Zbl 1418.11159
Guillevic, Aurore; Morain, François; Thomé, Emmanuel
2
2017
Linear time interactive certificates for the minimal polynomial and the determinant of a sparse matrix. Zbl 1365.65138
Dumas, Jean-Guillaume; Kaltofen, Erich; Thomé, Emmanuel; Villard, Gilles
2
2016
Computing theta functions in quasi-linear time in genus two and above. Zbl 1361.14028
Labrande, Hugo; Thomé, Emmanuel
2
2016
Root optimization of polynomials in the number field sieve. Zbl 1378.11104
Bai, Shi; Brent, Richard P.; Thomé, Emmanuel
3
2015
A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic. Zbl 1326.11080
Barbulescu, Razvan; Gaudry, Pierrick; Joux, Antoine; Thomé, Emmanuel
40
2014
Computing class polynomials for abelian surfaces. Zbl 1293.11107
Enge, Andreas; Thomé, Emmanuel
6
2014
Discrete logarithm in \(\mathrm{GF}(2^{809})\) with FFS. Zbl 1335.94029
Barbulescu, Razvan; Bouvier, Cyril; Detrey, Jérémie; Gaudry, Pierrick; Jeljeli, Hamza; Thomé, Emmanuel; Videau, Marion; Zimmermann, Paul
6
2014
Computation with no memory, and rearrangeable multicast networks. Zbl 1291.90041
Burckel, Serge; Gioan, Emeric; Thomé, Emmanuel
3
2014
Square root algorithms for the number field sieve. Zbl 1298.11114
Thomé, Emmanuel
2
2012
An \(L(1/3)\) discrete logarithm algorithm for low degree curves. Zbl 1208.94042
Enge, Andreas; Gaudry, Pierrick; Thomé, Emmanuel
6
2011
Factorization of a 768-bit RSA modulus. Zbl 1196.11167
Kleinjung, Thorsten; Aoki, Kazumaro; Franke, Jens; Lenstra, Arjen K.; Thomé, Emmanuel; Bos, Joppe W.; Gaudry, Pierrick; Kruppa, Alexander; Montgomery, Peter L.; Osvik, Dag Arne; te Riele, Herman; Timofeev, Andrey; Zimmermann, Paul
23
2010
Algorithmic number theory. 9th international symposium, ANTS-IX, Nancy, France, July 19–23, 2010. Proceedings. Zbl 1196.11006
Hanrot, Guillaume (ed.); Morain, François (ed.); Thomé, Emmanuel (ed.)
1
2010
Oracle-assisted static Diffie-Hellman is easier than discrete logarithms. Zbl 1234.94050
Joux, Antoine; Lercier, Reynald; Naccache, David; Thomé, Emmanuel
3
2009
Mapping computation with no memory. Zbl 1253.68125
Burckel, Serge; Gioan, Emeric; Thomé, Emmanuel
2
2009
Index calculus in class groups of non-hyperelliptic curves of genus three. Zbl 1167.11047
Diem, Claus; Thomé, Emmanuel
10
2008
Faster multiplication in \(\text{GF}(2)[x]\). Zbl 1230.11152
Brent, Richard P.; Gaudry, Pierrick; Thomé, Emmanuel; Zimmermann, Paul
6
2008
A double large prime variation for small genus hyperelliptic index calculus. Zbl 1179.94062
Gaudry, P.; Thomé, E.; Thériault, N.; Diem, C.
36
2007
When \(e\)-th roots become easier than factoring. Zbl 1153.11345
Joux, Antoine; Naccache, David; Thomé, Emmanuel
4
2007
Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm. Zbl 1010.65024
Thomé, Emmanuel
5
2002
Computation of discrete logarithms in \(\mathbb {F}_{2^{607}}\). Zbl 1062.11080
Thomé, Emmanuel
5
2001
Fast computation of linear generators for matrix sequences and application to the block Wiedemann algorithm. Zbl 1356.68296
Thomé, Emmanuel
3
2001
all top 5

Cited by 243 Authors

8 Thomé, Emmanuel
7 Gaudry, Pierrick
6 Barbulescu, Razvan
5 Diem, Claus
5 Menezes, Alfred J.
4 Sarkar, Palash
3 Frey, Gerhard
3 Gadouleau, Maximilien
3 Gorla, Elisa
3 Kleinjung, Thorsten
3 Labrande, Hugo
3 Lauter, Kristin Estella
3 Massierer, Maike
3 Oliveira, Thomaz
3 Pierrot, Cécile
3 Rodríguez-Henríquez, Francisco
3 Singh, Shashank Sheshar
3 Thériault, Nicolas
3 Zhuang, Jincheng
3 Zimmermann, Paul
2 Adj, Gora
2 Bai, Shi
2 Biasse, Jean-François
2 Brent, Richard Peirce
2 Costello, Craig
2 De Feo, Luca
2 Duquesne, Sylvain
2 Faugère, Jean-Charles
2 Galbraith, Steven D.
2 Granger, Robert A.
2 Guillevic, Aurore
2 Huang, Ming-Deh A.
2 Ibrahimi, Morteza
2 Jacobson, Michael John jun.
2 Joux, Antoine
2 Kani, Ernst J.
2 Kim, Taechan
2 Koblitz, Neal I.
2 Kraning, Matt
2 Lin, Dongdai
2 Lv, Chang
2 Micheli, Giacomo
2 Milio, Enea
2 Montanari, Andrea
2 Oyono, Roger
2 Renault, Guénaël
2 Robert, Damien
2 Schost, Éric
2 Stein, Andreas
2 Vitse, Vanessa
2 Wesolowski, Benjamin
2 Zhu, Yuqing
2 Zumbrägel, Jens
1 Abe, Masayuki
1 Aggarwal, Divesh
1 Alonso-Jiménez, José Antonio
1 Aracena, Julio
1 Aranda-Corral, Gonzalo A.
1 Avanzi, Roberto Maria
1 Balakrishnan, Jennifer S.
1 Balister, Paul N.
1 Bauch, Jens-Dietrich
1 Benhamouda, Fabrice
1 Bernstein, Daniel Julius
1 Bollobás, Béla
1 Borrego-Díaz, Joaquín
1 Bostan, Alin
1 Bouillaguet, Charles
1 Bouvier, Cyril
1 Boyle, Elette
1 Bridoux, Florian
1 Brooks, Ernest Hunter
1 Canales-Martínez, Isaac
1 Canteaut, Anne
1 Cardell, Sara D.
1 Carpov, Sergiu
1 Castillo-Ramirez, Alonso
1 Cervantes-Vázquez, Daniel
1 Chao, Jinhui
1 Chatterjee, Sanjit
1 Chen, Lijie
1 Cheng, Qi
1 Cherepniov, M. A.
1 Chu, Huah
1 Climent, Joan-Josep
1 Cohen, Gérard Denis
1 Coron, Jean-Sébastien
1 Cosset, Romain
1 Couteau, Geoffroy
1 Coxon, Nicholas
1 Cruz-Cortés, Nareli
1 Das, Abhijit
1 Das, M. Prem Laxman
1 de Valence, Henry
1 Delaplace, Claire
1 Demirkiran, Cevahir
1 Deng, Yingpu
1 Ducas, Léo
1 Dumas, Jean-Guillaume
1 Eberly, Wayne
...and 143 more Authors

Citations by Year

Wikidata Timeline

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.