Emmanuel Thomé
Permanent research scientist (CR1) at INRIA Lorraine, projet CARAMEL
Events
20100107: RSA-768 is factored
I am involved, or have been involved, or will be involved, in the organization of the following scientific events.
- ECC 2012 (Elliptic Curve Cryptography workshop), Oct 1–5, 2012, Queretaro, Mexico.
- ECC 2011 (Elliptic Curve Cryptography workshop), Sep 19–21, 2011, Nancy.
- WCC 2011 (Workshop on Coding and Cryptography), Apr 11–15, 2011, Paris.
- ANTS IX (Algebraic Number Theory Symposium), INRIA Lorraine, July 19–23, 2010.
- Journées Nationales de Calcul Formel 2008, CIRM, Luminy, 20 – 24 octobre 2008.
- CADO workshop on integer factorization, INRIA Lorraine, Oct. 7 – 9, 2008.
- Journées Nationales de Calcul Formel 2007, CIRM, Luminy, 29 janvier – 2 février 2007.
- Journées Codage et Cryptographie (C2) 2006, Eymoutiers, 15–20 octobre 2006.
- RNC7 conference, Loria, july 10–12, 2006.
Research interests
- Sparse linear algebra over finite fields and the block Wiedemann algorithm ;
relevant papers
1,
2,
3.
See also some software: cado-nfs, matlingen.
- The number field sieve and its cousins, notably for computing discrete logarithms over finite fields ;
relevant papers
1,
2,
3,
4,
5.
See also some software: cado-nfs, as well as an example sage worksheet for NFS.
- Discrete logarithms over algebraic curves ;
relevant papers
1,
2,
3.
- Computer arithmetic in general, in particular finite field and polynomial arithmetic ;
relevant papers
1,
2,
3,
4.
See also some software: gf2x, mpfq, mploc.
- Complex multiplication in genus 2, and computation of class polynomials using fast evaluation of theta constants.
Preliminary database available here (being populated).
I have a separate page with the complete list of my
Publications and Presentations.
Software
Some research software I have written:
- cado-nfs ; an implementation of the number field sieve algorithm. (Joint work with many people).
- gf2x ; a library for multiplying binary polynomials. (Joint work with R. Brent, P. Gaudry, P. Zimmermann)
- mpfq ; Perl code for generating C header files for fast finite field arithmetic. (Joint work with P. Gaudry)
- mploc ; a library for computing with p-adic rings.
- matlingen ; software for computing generating polynomials of matrix sequence over large prime fields.
More Software
Misc
INRIA Lorraine
bâtiment A, projet CARAMEL
615 rue du jardin botanique
54602 Villers-lès-Nancy Cedex
France
Phone: Depuis la france: 03 83 59 30 00 (standard)
From foreign countries: local intnl code 33 3 83 59 30
00
Email: Emmanuel.Thome at gmail.com
