International Association for Cryptologic Research
Emmanuel Thomé Search web for home page
Publications
| year | title | booktitle | pages | |
|---|---|---|---|---|
| 1 | 2011 | An L(1/3) Discrete Logarithm Algorithm for Low Degree Curves | jofc | 24-41 |
| 2 | 2010 | Factorization of a 768-Bit RSA Modulus | crypto | 333-350 |
| 3 | 2010 | Factorization of a 768-bit RSA modulus | eprint | online |
| 4 | 2008 | Index Calculus in Class Groups of Non-hyperelliptic Curves of Genus Three | jofc | 593-611 |
| 5 | 2008 | Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms | eprint | online |
| 6 | 2007 | When e-th Roots Become Easier Than Factoring | eprint | online |
| 7 | 2007 | When e-th Roots Become Easier Than Factoring | asiacrypt | 13-28 |
| 8 | 2004 | A double large prime variation for small genus hyperelliptic index calculus | eprint | online |
| 9 | 2001 | Computation of Discrete Logarithms in F2607 | asiacrypt | 107-124 |
Coauthors of Emmanuel Thomé |