Emmanuel Thomé

Publications

Note: this list is not always in sync with the list which is automatically generated from the HAL database. The latter is sometimes more accurate, not always.

The list below is generated automatically as well, basically from the same database, but with different display rules. Also, the contents are static. The "type" of each publication is indicated by a short code for which a glossary is given after the list.

Warning: because the XML export format of the HAL database has changed on 2015/01/01, I need to update my extraction script. Publications and preprints from 2015 on are not listed below, until I get around to fixing it. Meanwhile, the HAL link link can be used.

Some auto-generated pages: DBLP, DBLP-new, Google Scholar.

My Erdös number is 2, and will very likely not improve.

Currently displaying items of the following types: p rij ric ricp ed t vj oth

[IT14] ( p )	Isogeny graphs with maximal real multiplication Sorina Ionica, Emmanuel Thomé. 2014. Preprint. pdf (635k). HAL. arxiv. IACR eprint.
[BGJT14] ( ricp )	A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic Razvan Barbulescu, Pierrick Gaudry, Antoine Joux, Emmanuel Thomé. In Phong Q. Nguyen, Elisabeth Oswald (eds), Advances in Cryptology - EUROCRYPT 2014, vol. 8441 of Lecture Notes in Computer Science, p. 1–16. © Springer, 2014. Best paper award. pdf (460k). HAL. arxiv. IACR eprint.
[ET14] ( rij )	Computing class polynomials for abelian surfaces Andreas Enge, Emmanuel Thomé. Experimental Mathematics, vol. 23, p. 129–145. © Taylor and Francis, 2014. pdf (242k). HAL. arxiv. IACR eprint.
[BBT14] ( rij )	Root optimization of polynomials in the number field sieve Shi Bai, Richard Brent, Emmanuel Thomé. Mathematics of Computation, vol. ???, p. ???–???. © American Mathematical Society, 2014. pdf (202k). HAL.
[BGT14] ( rij )	Computation with No Memory, and Rearrangeable Multicast Networks Emeric Gioan, Serge Burckel, Emmanuel Thomé. Discrete Mathematics and Theoretical Computer Science, vol. 16, n. 1, p. 121–142. 2014. HAL.
[B+14] ( ricp )	Discrete logarithm in GF(2^809) with FFS Razvan Barbulescu, Cyril Bouvier, Jérémie Detrey, Pierrick Gaudry, Hamza Jeljeli, Emmanuel Thomé, Marion Videau, Paul Zimmermann. In Hugo Krawczyk (ed), PKC 2014 - International Conference on Practice and Theory of Public-Key Cryptography, vol. 8383 of LNCS, p. 221–238. © Springer, 2014. pdf (502k). HAL. IACR eprint.
[LKT13] ( oth )	(Humoristic) Universal Security; From bits and mips to pools, lakes - and beyond Arjen K. Lenstra, Thorsten Kleinjung, Emmanuel Thomé. In Marc Fischlin, Stefan Katzenbeisser (eds), Number Theory and Cryptography, vol. 8260 of Lecture Notes in Computer Science, p. 121–124. © Springer, 2013. pdf (198k). HAL. IACR eprint.
[T12b] ( t )	Théorie algorithmique des nombres et applications à la cryptanalyse de primitives cryptographiques Emmanuel Thomé. Habilitation to conduct research. Université de Lorraine, 2012. 218 pp. pdf (1383k). HAL.
[BTZ12] ( p )	Factorisation of RSA-704 with CADO-NFS Shi Bai, Emmanuel Thomé, Paul Zimmermann. 2012. Preprint. HAL. IACR eprint.
[T12] ( ricp )	Square root algorithms for the number field sieve Emmanuel Thomé. In Ferruh Özbudak, Francisco Rodríguez-Henríquez (eds), Arithmetic of Finite Fields 4th International Workshop, WAIFI 2012, Bochum, Germany, July 16-19, 2012. Proceedings, vol. 7369 of Lecture Notes in Computer Science, p. 208–224. © Springer, 2012. pdf (509k). HAL.
[K+12] ( rij )	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 Leyland, Peter L. Montgomery, Andrey Timofeev, Heinz Stockinger. Cluster Computing, vol. 15, n. 1, p. 53–68. © Springer-Verlag, 2012. HAL.
[C+12] ( ricp )	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. In Revote 2011 - International Workshop on Requirements Engineering for Electronic Voting Systems, p. 27–36. © IEEE, 2011. pdf (142k). HAL.
[T11a2] ( oth )	(Dictionary entry) Sieving in Function Fields Emmanuel Thomé. In Henk C. A. van Tilborg, Sushil Jajodia (eds), Encyclopedia of Cryptography and Security, p. 1205–1206. © Springer, 2011. Short entry in a dictionary-style work. HAL.
[T11a1] ( oth )	(Dictionary entry) Function Field Sieve Emmanuel Thomé. In Henk C. A. van Tilborg, Sushil Jajodia (eds), Encyclopedia of Cryptography and Security, p. 501–502. © Springer, 2011. Short entry in a dictionary-style work. HAL.
[GTZ11] ( vj )	RSA : la fin des clés de 768 bits Pierrick Gaudry, Emmanuel Thomé, Paul Zimmermann. Techniques de l'Ingenieur, n. IN131, p. ???–???. © Editions TI, 2011. HAL.
[EGT11] ( rij )	An $L (1/3)$ Discrete Logarithm Algorithm for Low Degree Curves Andreas Enge, Pierrick Gaudry, Emmanuel Thomé. Journal of Cryptology, vol. 24, p. 24–41. © Springer-Verlag, 2011. pdf (250k). HAL. arxiv.
[KNT10] ( ricp )	Using a grid platform for solving large sparse linear systems over GF(2) Thorsten Kleinjung, Lucas Nussbaum, Emmanuel Thomé. In 11th ACM/IEEE International Conference on Grid Computing (Grid 2010), p. 161–168. © IEEE, 2010. pdf (199k). HAL.
[K+10] ( ricp )	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 Te Riele, Andrey Timofeev, Paul Zimmermann. In Tal Rabin (ed), Advances in Cryptology - CRYPTO 2010, vol. 6223 of Lecture Notes in Computer Science, p. 333–350. © Springer Verlag, 2010. pdf (580k). HAL. IACR eprint.
[GMT10] ( ed )	Algorithmic Number Theory. 9th. International Symposium, ANTS-IX. Nancy, France, July 2010. Proceedings Guillaume Hanrot, François Morain, Emmanuel Thomé (eds). vol. 6197 of Lecture Notes in Computer Science. © Springer-Verlag, 2010. 397 pp. HAL.
[BGT09] ( ricp )	Mapping Computation with No Memory Serge Burckel, Emeric Gioan, Emmanuel Thomé. In UC'2009: 8th International Conference on Unconventional Computation, vol. 5715 of LNCS, p. 85–97. © Springer, 2009. HAL.
[JLNT09] ( ricp )	Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms Antoine Joux, Reynald Lercier, David Naccache, Emmanuel Thomé. In Matthew G. Parker (ed), Cryptography and Coding 12th IMA International Conference, Cryptography and Coding 2009, Cirencester, UK, December 15-17, 2009. Proceedings, vol. 5921 of Lecture Notes in Computer Science, p. 351–367. © Springer Berlin / Heidelberg, 2009. pdf (286k). HAL.
[BGTZ08] ( ricp )	Faster Multiplication in GF(2)[x] Richard P. Brent, Pierrick Gaudry, Emmanuel Thomé, Paul Zimmermann. In van der Poorten, Alfred, Stein, Andreas (eds), Algorithmic Number Theory, ANTS-VIII, vol. 5011 of Lecture notes in computer science, p. 153–166. © Springer-Verlag, 2008. pdf (260k). HAL.
[DT08] ( rij )	Index calculus in class groups of non-hyperelliptic curves of genus three Claus Diem, Emmanuel Thomé. Journal of Cryptology, vol. 21, n. 4, p. 593–611. © Springer-Verlag, 2008. pdf (239k). HAL.
[GTTD07] ( rij )	A double large prime variation for small genus hyperelliptic index calculus Pierrick Gaudry, Emmanuel Thomé, Nicolas Thériault, Claus Diem. Mathematics of Computation, vol. 76, p. 475–492. © AMS, 2007. pdf (176k). HAL. IACR eprint.
[JNT07] ( ricp )	When e-th Roots Become Easier Than Factoring Antoine Joux, David Naccache, Emmanuel Thomé. In Kaoru Kurosawa (ed), Advances in Cryptology -- ASIACRYPT 2007 13th International Conference on the Theory and Application of Cryptology and Information Security, Kuching, Malaysia, December 2-6, 2007. Proceedings, vol. 4833 of Lecture Notes in Computer Science, p. 13–28. © Springer Berlin / Heidelberg, 2007. pdf (274k). HAL.
[CHTZZ07] ( ricp )	Time- and Space-Efficient Evaluation of Some Hypergeometric Constants Howard Cheng, Guillaume Hanrot, Emmanuel Thomé, Eugene Zima, Paul Zimmermann. In Proceedings of the 2007 international symposium on Symbolic and algebraic computation, p. 85–91. © ACM, 2007. pdf (162k). HAL.
[GT07] ( ric )	The mpFq library and implementing curve-based key exchanges Pierrick Gaudry, Emmanuel Thomé. In SPEED: Software Performance Enhancement for Encryption and Decryption, p. 49–64. 2007. pdf (183k). HAL.
[T03] ( t )	Algorithmes de calcul de logarithmes discrets dans les corps finis Emmanuel Thomé. PhD thesis. Ecole Polytechnique X, 2003. 198 pp. pdf (1648k). HAL.
[T02] ( rij )	Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm Emmanuel Thomé. Journal of Symbolic Computation, vol. 33, n. 5, p. 757–775. © Elsevier, 2002. pdf (236k). HAL.
[T01b] ( ricp )	Computation of Discrete Logarithms in GF(2^607) Emmanuel Thomé. In C. Boyd, E. Dawson. (eds), Advances in Cryptology -- ASIACRYPT 2001, vol. 2248 of Lecture Notes in Computer Science, p. 107–124. © Springer--Verlag, 2001. pdf (196k). HAL.
[T01a] ( ricp )	Fast computation of linear generators for matrix sequences and application to the block Wiedemann algorithm Emmanuel Thomé. In Erich Kaltofen, Gilles Villard (eds), Proceedings of the 2001 international symposium on Symbolic and algebraic computation, p. 323–331. © ACM, 2001. pdf (163k). HAL.

Glossary:

( p ): preprint.
( rij ): reviewed international journals.
( ric ): reviewed international conferences.
( ricp ): reviewed international conferences with proceedings.
( ed ): volume edition.
( t ): theses.
( vj ): dissemination.
( oth ): other.

Short notes

NFS with gory details, Sage worksheet (draft), 2009. sws (30k), pdf (137k).
Karatsuba multiplication of polynomials with temporary space of size ≤ n, informal note, 2002. pdf (229k).