 | 2009 |
|---|
| 10 |       | Serge Burckel,
Emeric Gioan,
Emmanuel Thomé:
Mapping Computation with No Memory.
UC 2009: 85-97 |
| 9 | | Andreas Enge,
Pierrick Gaudry,
Emmanuel Thomé:
An $L (1/3)$ Discrete Logarithm Algorithm for Low Degree Curves
CoRR abs/0905.2177: (2009) |
| 2008 |
|---|
| 8 | | Richard P. Brent,
Pierrick Gaudry,
Emmanuel Thomé,
Paul Zimmermann:
Faster Multiplication in GF(2)[x].
ANTS 2008: 153-166 |
| 7 | | Claus Diem,
Emmanuel Thomé:
Index Calculus in Class Groups of Non-hyperelliptic Curves of Genus Three.
J. Cryptology 21(4): 593-611 (2008) |
| 2007 |
|---|
| 6 | | Antoine Joux,
David Naccache,
Emmanuel Thomé:
When e-th Roots Become Easier Than Factoring.
ASIACRYPT 2007: 13-28 |
| 5 | | Howard Cheng,
Guillaume Hanrot,
Emmanuel Thomé,
Paul Zimmermann,
Eugene V. Zima:
Time-and space-efficient evaluation of some hypergeometric constants.
ISSAC 2007: 85-91 |
| 4 | | Howard Cheng,
Guillaume Hanrot,
Emmanuel Thomé,
Eugene V. Zima,
Paul Zimmermann:
Time- and Space-Efficient Evaluation of Some Hypergeometric Constants
CoRR abs/cs/0701151: (2007) |
| 2002 |
|---|
| 3 | | Emmanuel Thomé:
Subquadratic Computation of Vector Generating Polynomials and Improvement of the Block Wiedemann Algorithm.
J. Symb. Comput. 33(5): 757-775 (2002) |
| 2001 |
|---|
| 2 | | Emmanuel Thomé:
Computation of Discrete Logarithms in F2607.
ASIACRYPT 2001: 107-124 |
| 1 | | Emmanuel Thomé:
Fast computation of linear generators for matrix sequences and application to the block Wiedemann algorithm.
ISSAC 2001: 323-331 |
