Skip to Main content Skip to Navigation

inria-00502899v1  Conference papers
Thorsten KleinjungLucas NussbaumEmmanuel Thomé. Using a grid platform for solving large sparse linear systems over GF(2)
11th ACM/IEEE International Conference on Grid Computing – Grid 2010, Oct 2010, Brussels, Belgium. ⟨10.1109/GRID.2010.5697952⟩
hal-01266041v3  Conference papers
Jean-Guillaume DumasErich KaltofenEmmanuel ThoméGilles Villard. Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix
ISSAC’2016, Proceedings of the 2016 ACM International Symposium on Symbolic and Algebraic Computation, Jul 2016, Waterloo, Canada. pp.199-206, ⟨10.1145/2930889.2930908⟩
hal-00967742v5  Journal articles
Sorina IonicaEmmanuel Thomé. Isogeny graphs with maximal real multiplication
Journal of Number Theory, Elsevier, 2020, 207, pp.385-422. ⟨10.1016/j.jnt.2019.06.019⟩
inria-00187782v1  Conference papers
Antoine JouxDavid NaccacheEmmanuel Thomé. When e-th Roots Become Easier Than Factoring
Advances in Cryptology -- ASIACRYPT 2007, Dec 2007, Kuching, Malaysia. pp.13-28, ⟨10.1007/978-3-540-76900-2_2⟩
lirmm-00959964v1  Journal articles
Emeric GioanSerge BurckelEmmanuel Thomé. Computation with No Memory, and Rearrangeable Multicast Networks
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2014, 16 (1), pp.121-142
lirmm-00395080v1  Conference papers
Serge BurckelEmeric GioanEmmanuel Thomé. Mapping Computation with No Memory
UC 2009: Unconventional Computation, Sep 2009, Ponta Delgada, Portugal. pp.85-97, ⟨10.1007/978-3-642-03745-0_15⟩
inria-00337753v2  Conference papers
Antoine JouxReynald LercierDavid NaccacheEmmanuel Thomé. Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms
Cryptography and Coding -- IMACC 2009, Dec 2009, Cirencester, United Kingdom. pp.351-367, ⟨10.1007/978-3-642-10868-6_21⟩
hal-00823745v2  Journal articles
Andreas EngeEmmanuel Thomé. Computing class polynomials for abelian surfaces
Experimental Mathematics, Taylor & Francis, 2014, 23 (2), pp.129-145. ⟨10.1080/10586458.2013.878675⟩
hal-03045666v1  Journal articles
Fabrice BoudotPierrick GaudryAurore GuillevicNadia HeningerEmmanuel Thomé et al.  Nouveaux records de factorisation et de calcul de logarithme discret
Techniques de l'Ingenieur, Techniques de l'ingénieur, 2020, pp.17
tel-00765982v2  Habilitation à diriger des recherches
Emmanuel Thomé. Théorie algorithmique des nombres et applications à la cryptanalyse de primitives cryptographiques
Cryptographie et sécurité [cs.CR]. Université de Lorraine, 2012
inria-00444693v2  Conference papers
Thorsten KleinjungKazumaro AokiJens FrankeArjen LenstraEmmanuel Thomé et al.  Factorization of a 768-bit RSA modulus
Advances in Cryptology – CRYPTO 2010, Aug 2010, Santa Barbara, United States. pp.333-350, ⟨10.1007/978-3-642-14623-7_18⟩
hal-00641592v1  Journal articles
Pierrick GaudryEmmanuel ThoméPaul Zimmermann. RSA : la fin des clés de 768 bits
Techniques de l'Ingenieur, Techniques de l'ingénieur, 2011
hal-00942002v1  Book sections
Emmanuel Thomé. Function Field Sieve
Henk C. A. van Tilborg and Sushil Jajodia. Encyclopedia of Cryptography and Security, Springer, pp.501-502, 2011, 978-1-4419-5905-8. ⟨10.1007/978-1-4419-5906-5_450⟩
hal-00942003v1  Book sections
Emmanuel Thomé. Sieving in Function Fields
Henk C. A. van Tilborg and Sushil Jajodia. Encyclopedia of Cryptography and Security, Springer, pp.1205-1206, 2011, 978-1-4419-5905-8. ⟨10.1007/978-1-4419-5906-5_476⟩
inria-00544503v1  Directions of work or proceedings
Guillaume HanrotFrançois MorainEmmanuel Thomé. Algorithmic Number Theory. 9th. International Symposium, ANTS-IX. Nancy, France, July 2010. Proceedings
Guillaume Hanrot and François Morain and Emmanuel Thomé. 6197, Springer-Verlag, pp.397, 2010, Lecture Notes in Computer Science, 978-3-642-14518-6. ⟨10.1007/978-3-642-14518-6⟩
inria-00168429v1  Conference papers
Pierrick GaudryEmmanuel Thomé. The mpFq library and implementing curve-based key exchanges
SPEED: Software Performance Enhancement for Encryption and Decryption, ECRYPT Network of Excellence in Cryptology, Jun 2007, Amsterdam, Netherlands. pp.49-64
inria-00177850v1  Conference papers
Howard ChengGuillaume HanrotEmmanuel ThoméEugene ZimaPaul Zimmermann. Time- and Space-Efficient Evaluation of Some Hypergeometric Constants
ISSAC '07: Proceedings of the 2007 international symposium on Symbolic and algebraic computation, Association for Computing Machinery, Jul 2007, Waterloo, Canada. pp.85-91, ⟨10.1145/1277548.1277561⟩
inria-00188261v4  Conference papers
Richard BrentPierrick GaudryEmmanuel ThoméPaul Zimmermann. Faster Multiplication in GF(2)[x]
Algorithmic Number Theory – ANTS-VIII, May 2008, Banff, Canada. pp.153-166, ⟨10.1007/978-3-540-79456-1⟩
hal-01276702v1  Conference papers
Emmanuel Thomé. Computing Discrete Logarithms in Small Characteristic Finite Fields in Quasi-Polynomial Time
The 9th International Workshop on Coding and Cryptography 2015 WCC2015, Anne Canteaut, Gaëtan Leurent, Maria Naya-Plasencia, Apr 2015, Paris, France