Search the dblp DataBase
Emmanuel Thomé :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Emmanuel Thomé Computation of Discrete Logarithms in F_{2607} . [Citation Graph (0, 0)][DBLP ] ASIACRYPT, 2001, pp:107-124 [Conf ] Emmanuel Thomé Fast computation of linear generators for matrix sequences and application to the block Wiedemann algorithm. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:323-331 [Conf ] Emmanuel Thomé Subquadratic Computation of Vector Generating Polynomials and Improvement of the Block Wiedemann Algorithm. [Citation Graph (0, 0)][DBLP ] J. Symb. Comput., 2002, v:33, n:5, pp:757-775 [Journal ] Antoine Joux , David Naccache , Emmanuel Thomé When e -th Roots Become Easier Than Factoring. [Citation Graph (0, 0)][DBLP ] ASIACRYPT, 2007, pp:13-28 [Conf ] Howard Cheng , Guillaume Hanrot , Emmanuel Thomé , Paul Zimmermann , Eugene V. Zima Time-and space-efficient evaluation of some hypergeometric constants. [Citation Graph (0, 0)][DBLP ] ISSAC, 2007, pp:85-91 [Conf ] Howard Cheng , Guillaume Hanrot , Emmanuel Thomé , Eugene V. Zima , Paul Zimmermann Time- and Space-Efficient Evaluation of Some Hypergeometric Constants [Citation Graph (0, 0)][DBLP ] CoRR, 2007, v:0, n:, pp:- [Journal ] Faster Multiplication in GF(2)[x]. [Citation Graph (, )][DBLP ] Factorization of a 768-Bit RSA Modulus. [Citation Graph (, )][DBLP ] Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms. [Citation Graph (, )][DBLP ] Mapping Computation with No Memory. [Citation Graph (, )][DBLP ] An $L (1/3)$ Discrete Logarithm Algorithm for Low Degree Curves [Citation Graph (, )][DBLP ] Search in 0.002secs, Finished in 0.003secs