Emmanuel Thomé

76 papers A* 3A 2B 3C 3Misc 2Journal 51Unranked 7

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	Discrete Logarithm Factory. IACR Commun. Cryptol. Haetham Al Aswad, Emmanuel Thomé, Cécile Pierrot
2023	J	`jnl`	Discrete Logarithm Factory. IACR Cryptol. ePrint Arch. Haetham Al Aswad, Cécile Pierrot, Emmanuel Thomé
2022	J	`jnl`	New discrete logarithm computation for the medium prime case using the function field sieve. Adv. Math. Commun. Madhurima Mukhopadhyay, Palash Sarkar, Shashank Singh, Emmanuel Thomé
2022	J	`jnl`	The State of the Art in Integer Factoring and Breaking Public-Key Cryptography. IEEE Secur. Priv. Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, Paul Zimmermann
2021	J	`jnl`	History of Cryptographic Key Sizes. IACR Cryptol. ePrint Arch. Nigel P. Smart, Emmanuel Thomé
2020	J	`jnl`	Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation. Des. Codes Cryptogr. Aurore Guillevic, Simon Masson, Emmanuel Thomé
2020	—	`conf`	Comparing the Difficulty of Factorization and Discrete Logarithm: A 240-Digit Experiment. CRYPTO (2) Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, Paul Zimmermann
2020	J	`jnl`	Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment. CoRR Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, Paul Zimmermann
2020	J	`jnl`	Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment. IACR Cryptol. ePrint Arch. Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, Paul Zimmermann
2020	J	`jnl`	New Discrete Logarithm Computation for the Medium Prime Case Using the Function Field Sieve. IACR Cryptol. ePrint Arch. Madhurima Mukhopadhyay, Palash Sarkar, Shashank Singh, Emmanuel Thomé
2020	J	`jnl`	Refined Analysis of the Asymptotic Complexity of the Number Field Sieve. CoRR Aude Le Gluher, Pierre-Jean Spaenlehauer, Emmanuel Thomé
2020	J	`jnl`	Refined Analysis of the Asymptotic Complexity of the Number Field Sieve. IACR Cryptol. ePrint Arch. Aude Le Gluher, Pierre-Jean Spaenlehauer, Emmanuel Thomé
2019	J	`jnl`	Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation. IACR Cryptol. ePrint Arch. Aurore Guillevic, Simon Masson, Emmanuel Thomé
2019	J	`jnl`	Fast integer multiplication using \goodbreak generalized Fermat primes. Math. Comput. Svyatoslav Covanov, Emmanuel Thomé
2019	J	`jnl`	Imperfect forward secrecy: how Diffie-Hellman fails in practice. Commun. ACM 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
2017	—	`conf`	A Kilobit Hidden SNFS Discrete Logarithm Computation. EUROCRYPT (1) Joshua Fried, Pierrick Gaudry, Nadia Heninger, Emmanuel Thomé
2017	Misc	`conf`	Computing Discrete Logarithms in 𝔽 SAC Laurent Grémy, Aurore Guillevic, François Morain, Emmanuel Thomé
2016	J	`jnl`	A kilobit hidden SNFS discrete logarithm computation. CoRR Joshua Fried, Pierrick Gaudry, Nadia Heninger, Emmanuel Thomé
2016	J	`jnl`	A kilobit hidden SNFS discrete logarithm computation. IACR Cryptol. ePrint Arch. Joshua Fried, Pierrick Gaudry, Nadia Heninger, Emmanuel Thomé
2016	J	`jnl`	A modified block Lanczos algorithm with fewer vectors. CoRR Emmanuel Thomé
2016	J	`jnl`	A modified block Lanczos algorithm with fewer vectors. IACR Cryptol. ePrint Arch. Emmanuel Thomé
2016	J	`jnl`	Computing theta functions in quasi-linear time in genus 2 and above. IACR Cryptol. ePrint Arch. Hugo Labrande, Emmanuel Thomé
2016	J	`jnl`	Computing theta functions in quasi-linear time in genus two and above. LMS J. Comput. Math. Hugo Labrande, Emmanuel Thomé
2016	B	`conf`	Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix. ISSAC Jean-Guillaume Dumas, Erich L. Kaltofen, Emmanuel Thomé, Gilles Villard
2016	J	`jnl`	Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix. CoRR Jean-Guillaume Dumas, Erich L. Kaltofen, Emmanuel Thomé, Gilles Villard
2016	Misc	`conf`	Solving Discrete Logarithms on a 170-Bit MNT Curve by Pairing Reduction. SAC Aurore Guillevic, François Morain, Emmanuel Thomé
2016	J	`jnl`	Solving discrete logarithms on a 170-bit MNT curve by pairing reduction. CoRR Aurore Guillevic, François Morain, Emmanuel Thomé
2016	J	`jnl`	Solving discrete logarithms on a 170-bit MNT curve by pairing reduction. IACR Cryptol. ePrint Arch. Aurore Guillevic, François Morain, Emmanuel Thomé
2015	J	`jnl`	Fast arithmetic for faster integer multiplication. CoRR Svyatoslav Covanov, Emmanuel Thomé
2015	A*	`conf`	Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice. CCS 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
2015	J	`jnl`	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 Jean-Guillaume Dumas, Erich L. Kaltofen, Emmanuel Thomé
2015	J	`jnl`	Root optimization of polynomials in the number field sieve. Math. Comput. Shi Bai, Richard P. Brent, Emmanuel Thomé
2014	A*	`conf`	A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic. EUROCRYPT Razvan Barbulescu, Pierrick Gaudry, Antoine Joux, Emmanuel Thomé
2014	J	`jnl`	Computation with No Memory, and Rearrangeable Multicast Networks. Discret. Math. Theor. Comput. Sci. Serge Burckel, Emeric Gioan, Emmanuel Thomé
2014	J	`jnl`	Computing Class Polynomials for Abelian Surfaces. Exp. Math. Andreas Enge, Emmanuel Thomé
2014	—	`conf`	Discrete Logarithm in GF(2809) with FFS. Public Key Cryptography Razvan Barbulescu, Cyril Bouvier, Jérémie Detrey, Pierrick Gaudry, Hamza Jeljeli, Emmanuel Thomé, Marion Videau, Paul Zimmermann
2014	J	`jnl`	Isogeny graphs with maximal real multiplication. IACR Cryptol. ePrint Arch. Sorina Ionica, Emmanuel Thomé
2013	J	`jnl`	A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic. CoRR Razvan Barbulescu, Pierrick Gaudry, Antoine Joux, Emmanuel Thomé
2013	J	`jnl`	A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic. IACR Cryptol. ePrint Arch. Razvan Barbulescu, Pierrick Gaudry, Antoine Joux, Emmanuel Thomé
2013	J	`jnl`	Computation with No Memory, and Rearrangeable Multicast Networks. CoRR Serge Burckel, Emeric Gioan, Emmanuel Thomé
2013	J	`jnl`	Computing class polynomials for abelian surfaces CoRR Andreas Enge, Emmanuel Thomé
2013	J	`jnl`	Computing class polynomials for abelian surfaces. IACR Cryptol. ePrint Arch. Andreas Enge, Emmanuel Thomé
2013	J	`jnl`	Discrete logarithm in GF(2 IACR Cryptol. ePrint Arch. Razvan Barbulescu, Cyril Bouvier, Jérémie Detrey, Pierrick Gaudry, Hamza Jeljeli, Emmanuel Thomé, Marion Videau, Paul Zimmermann
2013	—	`conf`	Universal Security - From Bits and Mips to Pools, Lakes - and Beyond. Number Theory and Cryptography Arjen K. Lenstra, Thorsten Kleinjung, Emmanuel Thomé
2013	J	`jnl`	Universal security; from bits and mips to pools, lakes - and beyond. IACR Cryptol. ePrint Arch. Arjen K. Lenstra, Thorsten Kleinjung, Emmanuel Thomé
2012	J	`jnl`	A heterogeneous computing environment to solve the 768-bit RSA challenge. Clust. Comput. 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
2012	J	`jnl`	Factorisation of RSA-704 with CADO-NFS. IACR Cryptol. ePrint Arch. Shi Bai, Emmanuel Thomé, Paul Zimmermann
2012	J	`jnl`	Root Optimization of Polynomials in the Number Field Sieve. IACR Cryptol. ePrint Arch. Shi Bai, Richard P. Brent, Emmanuel Thomé
2012	J	`jnl`	Root optimization of polynomials in the number field sieve CoRR Shi Bai, Richard P. Brent, Emmanuel Thomé
2012	C	`conf`	Square Root Algorithms for the Number Field Sieve. WAIFI Emmanuel Thomé
2012	—	`book`	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é
2011	J	`jnl`	An J. Cryptol. Andreas Enge, Pierrick Gaudry, Emmanuel Thomé
2011	—	`conf`	Ballot stuffing in a postal voting system. REVOTE Véronique Cortier, Jérémie Detrey, Pierrick Gaudry, Frédéric Sur, Emmanuel Thomé, Mathieu Turuani, Paul Zimmermann
2011	—	`ch.`	Function Field Sieve. Encyclopedia of Cryptography and Security (2nd Ed.) Emmanuel Thomé
2011	—	`ch.`	Sieving in Function Fields. Encyclopedia of Cryptography and Security (2nd Ed.) Emmanuel Thomé
2010	—	`ed.`	Algorithmic Number Theory, 9th International Symposium, ANTS-IX, Nancy, France, July 19-23, 2010. Proceedings ANTS Guillaume Hanrot, François Morain, Emmanuel Thomé
2010	A*	`conf`	Factorization of a 768-Bit RSA Modulus. CRYPTO 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
2010	J	`jnl`	Factorization of a 768-bit RSA modulus. IACR Cryptol. ePrint Arch. 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
2010	—	`conf`	Using a grid platform for solving large sparse linear systems over GF(2). GRID Thorsten Kleinjung, Lucas Nussbaum, Emmanuel Thomé
2009	J	`jnl`	Abstracts of the CADO workshop on integer factorization. ACM Commun. Comput. Algebra Emmanuel Thomé
2009	J	`jnl`	An $L (1/3)$ Discrete Logarithm Algorithm for Low Degree Curves CoRR Andreas Enge, Pierrick Gaudry, Emmanuel Thomé
2009	C	`conf`	Mapping Computation with No Memory. UC Serge Burckel, Emeric Gioan, Emmanuel Thomé
2009	C	`conf`	Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms. IMACC Antoine Joux, Reynald Lercier, David Naccache, Emmanuel Thomé
2008	—	`conf`	Faster Multiplication in GF(2)[x]. ANTS Richard P. Brent, Pierrick Gaudry, Emmanuel Thomé, Paul Zimmermann
2008	J	`jnl`	Index Calculus in Class Groups of Non-hyperelliptic Curves of Genus Three. J. Cryptol. Claus Diem, Emmanuel Thomé
2008	J	`jnl`	Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms. IACR Cryptol. ePrint Arch. Antoine Joux, Reynald Lercier, David Naccache, Emmanuel Thomé
2007	J	`jnl`	A double large prime variation for small genus hyperelliptic index calculus. Math. Comput. Pierrick Gaudry, Emmanuel Thomé, Nicolas Thériault, Claus Diem
2007	J	`jnl`	Time- and Space-Efficient Evaluation of Some Hypergeometric Constants CoRR Howard Cheng, Guillaume Hanrot, Emmanuel Thomé, Eugene V. Zima, Paul Zimmermann
2007	B	`conf`	Time-and space-efficient evaluation of some hypergeometric constants. ISSAC Howard Cheng, Guillaume Hanrot, Emmanuel Thomé, Paul Zimmermann, Eugene V. Zima
2007	A	`conf`	When ASIACRYPT Antoine Joux, David Naccache, Emmanuel Thomé
2007	J	`jnl`	When e-th Roots Become Easier Than Factoring. IACR Cryptol. ePrint Arch. Antoine Joux, David Naccache, Emmanuel Thomé
2004	J	`jnl`	A double large prime variation for small genus hyperelliptic index calculus. IACR Cryptol. ePrint Arch. Pierrick Gaudry, Emmanuel Thomé, Nicolas Thériault, Claus Diem
2003	—	`—`	Algorithmes de calcul de logarithmes discrets dans les corps finis. Emmanuel Thomé
2002	J	`jnl`	Subquadratic Computation of Vector Generating Polynomials and Improvement of the Block Wiedemann Algorithm. J. Symb. Comput. Emmanuel Thomé
2001	A	`conf`	Computation of Discrete Logarithms in F ASIACRYPT Emmanuel Thomé
2001	B	`conf`	Fast computation of linear generators for matrix sequences and application to the block Wiedemann algorithm. ISSAC Emmanuel Thomé