Emmanuel Thomé

According to our database, Emmanuel Thomé authored at least 51 papers between 2001 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Discrete Logarithm Factory.

Haetham Al Aswad, Cécile Pierrot, Emmanuel Thomé

IACR Cryptol. ePrint Arch., 2023

2022

The State of the Art in Integer Factoring and Breaking Public-Key Cryptography.

Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, Paul Zimmermann

IEEE Secur. Priv., 2022

New discrete logarithm computation for the medium prime case using the function field sieve.

Madhurima Mukhopadhyay, Palash Sarkar, Shashank Singh, Emmanuel Thomé

Adv. Math. Commun., 2022

2021

History of Cryptographic Key Sizes.

Nigel P. Smart, Emmanuel Thomé

IACR Cryptol. ePrint Arch., 2021

2020

Refined Analysis of the Asymptotic Complexity of the Number Field Sieve.

Aude Le Gluher, Pierre-Jean Spaenlehauer, Emmanuel Thomé

IACR Cryptol. ePrint Arch., 2020

Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment.

Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, Paul Zimmermann

IACR Cryptol. ePrint Arch., 2020

Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation.

Aurore Guillevic, Simon Masson, Emmanuel Thomé

Des. Codes Cryptogr., 2020

2019

Fast integer multiplication using \goodbreak generalized Fermat primes.

Svyatoslav Covanov, Emmanuel Thomé

Math. Comput., 2019

Imperfect forward secrecy: how Diffie-Hellman fails in practice.

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

Commun. ACM, 2019

2017

Computing Discrete Logarithms in 𝔽_p⁶.

Laurent Grémy, Aurore Guillevic, François Morain, Emmanuel Thomé

Proceedings of the Selected Areas in Cryptography - SAC 2017, 2017

2016

Computing theta functions in quasi-linear time in genus two and above.

Hugo Labrande, Emmanuel Thomé

LMS J. Comput. Math., 2016

A modified block Lanczos algorithm with fewer vectors.

Emmanuel Thomé

IACR Cryptol. ePrint Arch., 2016

Computing theta functions in quasi-linear time in genus 2 and above.

Hugo Labrande, Emmanuel Thomé

IACR Cryptol. ePrint Arch., 2016

Solving discrete logarithms on a 170-bit MNT curve by pairing reduction.

Aurore Guillevic, François Morain, Emmanuel Thomé

IACR Cryptol. ePrint Arch., 2016

A kilobit hidden SNFS discrete logarithm computation.

Joshua Fried, Pierrick Gaudry, Nadia Heninger, Emmanuel Thomé

IACR Cryptol. ePrint Arch., 2016

Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix.

Jean-Guillaume Dumas, Erich L. Kaltofen, Emmanuel Thomé, Gilles Villard

Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

2015

Root optimization of polynomials in the number field sieve.

Shi Bai, Richard P. Brent, Emmanuel Thomé

Math. Comput., 2015

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.

Jean-Guillaume Dumas, Erich L. Kaltofen, Emmanuel Thomé

CoRR, 2015

Fast arithmetic for faster integer multiplication.

Svyatoslav Covanov, Emmanuel Thomé

CoRR, 2015

2014

Isogeny graphs with maximal real multiplication.

Sorina Ionica, Emmanuel Thomé

IACR Cryptol. ePrint Arch., 2014

Computing Class Polynomials for Abelian Surfaces.

Andreas Enge, Emmanuel Thomé

Exp. Math., 2014

Computation with No Memory, and Rearrangeable Multicast Networks.

Serge Burckel, Emeric Gioan, Emmanuel Thomé

Discret. Math. Theor. Comput. Sci., 2014

Discrete Logarithm in GF(2809) with FFS.

Razvan Barbulescu, Cyril Bouvier, Jérémie Detrey, Pierrick Gaudry, Hamza Jeljeli, Emmanuel Thomé, Marion Videau, Paul Zimmermann

Proceedings of the Public-Key Cryptography - PKC 2014, 2014

A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic.

Razvan Barbulescu, Pierrick Gaudry, Antoine Joux, Emmanuel Thomé

Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

2013

Universal security; from bits and mips to pools, lakes - and beyond.

Arjen K. Lenstra, Thorsten Kleinjung, Emmanuel Thomé

IACR Cryptol. ePrint Arch., 2013

A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic.

Razvan Barbulescu, Pierrick Gaudry, Antoine Joux, Emmanuel Thomé

IACR Cryptol. ePrint Arch., 2013

Discrete logarithm in GF(2⁸⁰⁹) with FFS.

Razvan Barbulescu, Cyril Bouvier, Jérémie Detrey, Pierrick Gaudry, Hamza Jeljeli, Emmanuel Thomé, Marion Videau, Paul Zimmermann

IACR Cryptol. ePrint Arch., 2013

2012

Factorisation of RSA-704 with CADO-NFS.

Shi Bai, Emmanuel Thomé, Paul Zimmermann

IACR Cryptol. ePrint Arch., 2012

A heterogeneous computing environment to solve the 768-bit RSA challenge.

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

Clust. Comput., 2012

Square Root Algorithms for the Number Field Sieve.

Emmanuel Thomé

Proceedings of the Arithmetic of Finite Fields - 4th International Workshop, 2012

Théorie algorithmique des nombres et applications à la cryptanalyse de primitives cryptographiques. (Algorithmic Number Theory and Applications to the Cryptanalysis of Cryptographical Primitives).

Emmanuel Thomé

, 2012

2011

Sieving in Function Fields.

Emmanuel Thomé

Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Function Field Sieve.

Emmanuel Thomé

Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

An <i>L</i>(1/3) Discrete Logarithm Algorithm for Low Degree Curves.

Andreas Enge, Pierrick Gaudry, Emmanuel Thomé

J. Cryptol., 2011

Ballot stuffing in a postal voting system.

Véronique Cortier, Jérémie Detrey, Pierrick Gaudry, Frédéric Sur, Emmanuel Thomé, Mathieu Turuani, Paul Zimmermann

Proceedings of the 2011 International Workshop on Requirements Engineering for Electronic Voting Systems, 2011

2010

Factorization of a 768-bit RSA modulus.

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

IACR Cryptol. ePrint Arch., 2010

Using a grid platform for solving large sparse linear systems over GF(2).

Thorsten Kleinjung, Lucas Nussbaum, Emmanuel Thomé

Proceedings of the 2010 11th IEEE/ACM International Conference on Grid Computing, 2010

2009

An $L (1/3)$ Discrete Logarithm Algorithm for Low Degree Curves

Andreas Enge, Pierrick Gaudry, Emmanuel Thomé

CoRR, 2009

Abstracts of the CADO workshop on integer factorization.

Emmanuel Thomé

ACM Commun. Comput. Algebra, 2009

Mapping Computation with No Memory.

Serge Burckel, Emeric Gioan, Emmanuel Thomé

Proceedings of the Unconventional Computation, 8th International Conference, 2009

2008

Index Calculus in Class Groups of Non-hyperelliptic Curves of Genus Three.

Claus Diem, Emmanuel Thomé

J. Cryptol., 2008

Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms.

Antoine Joux, Reynald Lercier, David Naccache, Emmanuel Thomé

IACR Cryptol. ePrint Arch., 2008

Faster Multiplication in GF(2)[x].

Richard P. Brent, Pierrick Gaudry, Emmanuel Thomé, Paul Zimmermann

Proceedings of the Algorithmic Number Theory, 8th International Symposium, 2008

2007

A double large prime variation for small genus hyperelliptic index calculus.

Pierrick Gaudry, Emmanuel Thomé, Nicolas Thériault, Claus Diem

Math. Comput., 2007

When e-th Roots Become Easier Than Factoring.

Antoine Joux, David Naccache, Emmanuel Thomé

IACR Cryptol. ePrint Arch., 2007

Time-and space-efficient evaluation of some hypergeometric constants.

Howard Cheng, Guillaume Hanrot, Emmanuel Thomé, Paul Zimmermann, Eugene V. Zima

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

When <i>e</i>-th Roots Become Easier Than Factoring.

Antoine Joux, David Naccache, Emmanuel Thomé

Proceedings of the Advances in Cryptology, 2007

2003

Algorithmes de calcul de logarithmes discrets dans les corps finis.

Emmanuel Thomé

PhD thesis, 2003

2002

Subquadratic Computation of Vector Generating Polynomials and Improvement of the Block Wiedemann Algorithm.

Emmanuel Thomé

J. Symb. Comput., 2002

2001

Fast computation of linear generators for matrix sequences and application to the block Wiedemann algorithm.

Emmanuel Thomé

Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, 2001

Computation of Discrete Logarithms in F_2⁶⁰⁷.

Emmanuel Thomé

Proceedings of the Advances in Cryptology, 2001