Emmanuel Thomé

ORCID

Publication Activity (10 Years)

Years Active: 2001-2023
Publications (10 Years): 26

Top Venues

IACR Cryptol. ePrint Arch.

CoRR

SAC

Math. Comput.

École Polytechnique, Palaiseau, France (PHD)

Education History

École Polytechnique, Palaiseau, France

PHD

Publications

Haetham Al Aswad, Cécile Pierrot, Emmanuel Thomé
Discrete Logarithm Factory. IACR Cryptol. ePrint Arch. 2023 (2023)
Madhurima Mukhopadhyay, Palash Sarkar, Shashank Singh, Emmanuel Thomé
New discrete logarithm computation for the medium prime case using the function field sieve. Adv. Math. Commun. 16 (3) (2022)
Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, Paul Zimmermann
The State of the Art in Integer Factoring and Breaking Public-Key Cryptography. IEEE Secur. Priv. 20 (2) (2022)
Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, Paul Zimmermann
Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment. IACR Cryptol. ePrint Arch. 2020 (2020)
Aude Le Gluher, Pierre-Jean Spaenlehauer, Emmanuel Thomé
Refined Analysis of the Asymptotic Complexity of the Number Field Sieve. IACR Cryptol. ePrint Arch. 2020 (2020)
Madhurima Mukhopadhyay, Palash Sarkar, Shashank Singh, Emmanuel Thomé
New Discrete Logarithm Computation for the Medium Prime Case Using the Function Field Sieve. IACR Cryptol. ePrint Arch. 2020 (2020)
Aurore Guillevic, Simon Masson, Emmanuel Thomé
Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation. Des. Codes Cryptogr. 88 (6) (2020)
Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, Paul Zimmermann
Comparing the Difficulty of Factorization and Discrete Logarithm: A 240-Digit Experiment. CRYPTO (2) (2020)
Aude Le Gluher, Pierre-Jean Spaenlehauer, Emmanuel Thomé
Refined Analysis of the Asymptotic Complexity of the Number Field Sieve. CoRR (2020)
Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, Paul Zimmermann
Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment. CoRR (2020)
David Adrian, Karthikeyan Bhargavan, Zakir Durumeric, Pierrick Gaudry, Matthew Green, J. Alex Halderman, Nadia Heninger, Drew Springall, Emmanuel Thomé, Luke Valenta, Benjamin VanderSloot, Eric Wustrow, Santiago Zanella Béguelin, Paul Zimmermann
Imperfect forward secrecy: how Diffie-Hellman fails in practice. Commun. ACM 62 (1) (2019)
Svyatoslav Covanov, Emmanuel Thomé
Fast integer multiplication using \goodbreak generalized Fermat primes. Math. Comput. 88 (317) (2019)
Aurore Guillevic, Simon Masson, Emmanuel Thomé
Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation. IACR Cryptol. ePrint Arch. 2019 (2019)
Joshua Fried, Pierrick Gaudry, Nadia Heninger, Emmanuel Thomé
A Kilobit Hidden SNFS Discrete Logarithm Computation. EUROCRYPT (1) (2017)
Laurent Grémy, Aurore Guillevic, François Morain, Emmanuel Thomé
. SAC (2017)
Jean-Guillaume Dumas, Erich Kaltofen, Emmanuel Thomé, Gilles Villard
Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix. CoRR (2016)
Hugo Labrande, Emmanuel Thomé
Computing theta functions in quasi-linear time in genus two and above. LMS J. Comput. Math. 19 (A) (2016)
Joshua Fried, Pierrick Gaudry, Nadia Heninger, Emmanuel Thomé
A kilobit hidden SNFS discrete logarithm computation. IACR Cryptol. ePrint Arch. 2016 (2016)
Joshua Fried, Pierrick Gaudry, Nadia Heninger, Emmanuel Thomé
A kilobit hidden SNFS discrete logarithm computation. CoRR (2016)
Aurore Guillevic, François Morain, Emmanuel Thomé
Solving discrete logarithms on a 170-bit MNT curve by pairing reduction. IACR Cryptol. ePrint Arch. 2016 (2016)
Aurore Guillevic, François Morain, Emmanuel Thomé
Solving discrete logarithms on a 170-bit MNT curve by pairing reduction. CoRR (2016)
Aurore Guillevic, François Morain, Emmanuel Thomé
Solving Discrete Logarithms on a 170-Bit MNT Curve by Pairing Reduction. SAC (2016)
Hugo Labrande, Emmanuel Thomé
Computing theta functions in quasi-linear time in genus 2 and above. IACR Cryptol. ePrint Arch. 2016 (2016)
Emmanuel Thomé
A modified block Lanczos algorithm with fewer vectors. CoRR (2016)
Jean-Guillaume Dumas, Erich Kaltofen, Emmanuel Thomé, Gilles Villard
Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix. ISSAC (2016)
Emmanuel Thomé
A modified block Lanczos algorithm with fewer vectors. IACR Cryptol. ePrint Arch. 2016 (2016)
David Adrian, Karthikeyan Bhargavan, Zakir Durumeric, Pierrick Gaudry, Matthew Green, J. Alex Halderman, Nadia Heninger, Drew Springall, Emmanuel Thomé, Luke Valenta, Benjamin VanderSloot, Eric Wustrow, Santiago Zanella Béguelin, Paul Zimmermann
Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice. CCS (2015)
Shi Bai, Richard P. Brent, Emmanuel Thomé
Root optimization of polynomials in the number field sieve. Math. Comput. 84 (295) (2015)
Svyatoslav Covanov, Emmanuel Thomé
Fast arithmetic for faster integer multiplication. CoRR (2015)
Jean-Guillaume Dumas, Erich Kaltofen, Emmanuel Thomé
Interactive certificate for the verification of Wiedemann's Krylov sequence: application to the certification of the determinant, the minimal and the characteristic polynomials of sparse matrices. CoRR (2015)
Razvan Barbulescu, Cyril Bouvier, Jérémie Detrey, Pierrick Gaudry, Hamza Jeljeli, Emmanuel Thomé, Marion Videau, Paul Zimmermann
Discrete Logarithm in GF(2809) with FFS. Public Key Cryptography (2014)
Razvan Barbulescu, Pierrick Gaudry, Antoine Joux, Emmanuel Thomé
A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic. EUROCRYPT (2014)
Sorina Ionica, Emmanuel Thomé
Isogeny graphs with maximal real multiplication. IACR Cryptol. ePrint Arch. 2014 (2014)
Serge Burckel, Emeric Gioan, Emmanuel Thomé
Computation with No Memory, and Rearrangeable Multicast Networks. Discret. Math. Theor. Comput. Sci. 16 (1) (2014)
Andreas Enge, Emmanuel Thomé
Computing Class Polynomials for Abelian Surfaces. Exp. Math. 23 (2) (2014)
Arjen K. Lenstra, Thorsten Kleinjung, Emmanuel Thomé
Universal security; from bits and mips to pools, lakes - and beyond. IACR Cryptol. ePrint Arch. 2013 (2013)
Arjen K. Lenstra, Thorsten Kleinjung, Emmanuel Thomé
Universal Security - From Bits and Mips to Pools, Lakes - and Beyond. Number Theory and Cryptography (2013)
Razvan Barbulescu, Cyril Bouvier, Jérémie Detrey, Pierrick Gaudry, Hamza Jeljeli, Emmanuel Thomé, Marion Videau, Paul Zimmermann
) with FFS. IACR Cryptol. ePrint Arch. 2013 (2013)
Razvan Barbulescu, Pierrick Gaudry, Antoine Joux, Emmanuel Thomé
A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic. IACR Cryptol. ePrint Arch. 2013 (2013)
Andreas Enge, Emmanuel Thomé
Computing class polynomials for abelian surfaces. IACR Cryptol. ePrint Arch. 2013 (2013)
Razvan Barbulescu, Pierrick Gaudry, Antoine Joux, Emmanuel Thomé
A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic. CoRR (2013)
Andreas Enge, Emmanuel Thomé
Computing class polynomials for abelian surfaces CoRR (2013)
Serge Burckel, Emeric Gioan, Emmanuel Thomé
Computation with No Memory, and Rearrangeable Multicast Networks. CoRR (2013)
Emmanuel Thomé
Square Root Algorithms for the Number Field Sieve. WAIFI (2012)
Shi Bai, Richard P. Brent, Emmanuel Thomé
Root Optimization of Polynomials in the Number Field Sieve. IACR Cryptol. ePrint Arch. 2012 (2012)
Shi Bai, Emmanuel Thomé, Paul Zimmermann
Factorisation of RSA-704 with CADO-NFS. IACR Cryptol. ePrint Arch. 2012 (2012)
Shi Bai, Richard P. Brent, Emmanuel Thomé
Root optimization of polynomials in the number field sieve CoRR (2012)
Thorsten Kleinjung, Joppe W. Bos, Arjen K. Lenstra, Dag Arne Osvik, Kazumaro Aoki, Scott Contini, Jens Franke, Emmanuel Thomé, Pascal Jermini, Michela Thiémard, Paul C. Leyland, Peter L. Montgomery, Andrey Timofeev, Heinz Stockinger
A heterogeneous computing environment to solve the 768-bit RSA challenge. Clust. Comput. 15 (1) (2012)
Véronique Cortier, Jérémie Detrey, Pierrick Gaudry, Frédéric Sur, Emmanuel Thomé, Mathieu Turuani, Paul Zimmermann
Ballot stuffing in a postal voting system. REVOTE (2011)
Andreas Enge, Pierrick Gaudry, Emmanuel Thomé
(1/3) Discrete Logarithm Algorithm for Low Degree Curves. J. Cryptol. 24 (1) (2011)
Thorsten Kleinjung, Kazumaro Aoki, Jens Franke, Arjen K. Lenstra, Emmanuel Thomé, Joppe W. Bos, Pierrick Gaudry, Alexander Kruppa, Peter L. Montgomery, Dag Arne Osvik, Herman J. J. te Riele, Andrey Timofeev, Paul Zimmermann
Factorization of a 768-bit RSA modulus. IACR Cryptol. ePrint Arch. 2010 (2010)
Thorsten Kleinjung, Lucas Nussbaum, Emmanuel Thomé
Using a grid platform for solving large sparse linear systems over GF(2). GRID (2010)
Thorsten Kleinjung, Kazumaro Aoki, Jens Franke, Arjen K. Lenstra, Emmanuel Thomé, Joppe W. Bos, Pierrick Gaudry, Alexander Kruppa, Peter L. Montgomery, Dag Arne Osvik, Herman J. J. te Riele, Andrey Timofeev, Paul Zimmermann
Factorization of a 768-Bit RSA Modulus. CRYPTO (2010)
Serge Burckel, Emeric Gioan, Emmanuel Thomé
Mapping Computation with No Memory. UC (2009)
Andreas Enge, Pierrick Gaudry, Emmanuel Thomé
An $L (1/3)$ Discrete Logarithm Algorithm for Low Degree Curves CoRR (2009)
Antoine Joux, Reynald Lercier, David Naccache, Emmanuel Thomé
Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms. IMACC (2009)
Emmanuel Thomé
Abstracts of the CADO workshop on integer factorization. ACM Commun. Comput. Algebra 43 (1/2) (2009)
Richard P. Brent, Pierrick Gaudry, Emmanuel Thomé, Paul Zimmermann
Faster Multiplication in GF(2)[x]. ANTS (2008)
Claus Diem, Emmanuel Thomé
Index Calculus in Class Groups of Non-hyperelliptic Curves of Genus Three. J. Cryptol. 21 (4) (2008)
Antoine Joux, Reynald Lercier, David Naccache, Emmanuel Thomé
Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms. IACR Cryptol. ePrint Arch. 2008 (2008)
Antoine Joux, David Naccache, Emmanuel Thomé
-th Roots Become Easier Than Factoring. ASIACRYPT (2007)
Pierrick Gaudry, Emmanuel Thomé, Nicolas Thériault, Claus Diem
A double large prime variation for small genus hyperelliptic index calculus. Math. Comput. 76 (257) (2007)
Antoine Joux, David Naccache, Emmanuel Thomé
When e-th Roots Become Easier Than Factoring. IACR Cryptol. ePrint Arch. 2007 (2007)
Howard Cheng, Guillaume Hanrot, Emmanuel Thomé, Paul Zimmermann, Eugene V. Zima
Time-and space-efficient evaluation of some hypergeometric constants. ISSAC (2007)
Howard Cheng, Guillaume Hanrot, Emmanuel Thomé, Eugene V. Zima, Paul Zimmermann
Time- and Space-Efficient Evaluation of Some Hypergeometric Constants CoRR (2007)
Pierrick Gaudry, Emmanuel Thomé, Nicolas Thériault, Claus Diem
A double large prime variation for small genus hyperelliptic index calculus. IACR Cryptol. ePrint Arch. 2004 (2004)
Emmanuel Thomé
Subquadratic Computation of Vector Generating Polynomials and Improvement of the Block Wiedemann Algorithm. J. Symb. Comput. 33 (5) (2002)
Emmanuel Thomé
. ASIACRYPT (2001)
Emmanuel Thomé
Fast computation of linear generators for matrix sequences and application to the block Wiedemann algorithm. ISSAC (2001)

Emmanuel Thomé.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Emmanuel Thomé