The SCEAS System
Navigation Menu

Search the dblp DataBase


Emmanuel Thomé: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Emmanuel Thomé
    Computation of Discrete Logarithms in F2607. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2001, pp:107-124 [Conf]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. 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]

  7. Faster Multiplication in GF(2)[x]. [Citation Graph (, )][DBLP]

  8. Factorization of a 768-Bit RSA Modulus. [Citation Graph (, )][DBLP]

  9. Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms. [Citation Graph (, )][DBLP]

  10. Mapping Computation with No Memory. [Citation Graph (, )][DBLP]

  11. An $L (1/3)$ Discrete Logarithm Algorithm for Low Degree Curves [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.003secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002