Emmanuel Thomé

1. A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic
   2013/06/18 by Razvan Barbulescu, Barbulescu, Razvan, Pierrick Gaudry +5 · 1 voice
   Computer Science · Mathematics · #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #FOS: Mathematics #Number Theory (math.NT) #cs.CR #math.NT
2. Time- and Space-Efficient Evaluation of Some Hypergeometric Constants
   2007/01/25 by Howard Cheng, Cheng, Howard, Guillaume Hanrot +7 · 1 citation
   Computer Science · #Polynomial and algebraic computation #Numerical Methods and Algorithms #Cryptography and Residue Arithmetic
3. A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
   2014/01/01 by Razvan Barbulescu, Pierrick Gaudry, Antoine Joux +1 · 1 citation
   Computer Science · #Coding theory and cryptography #Cryptography and Data Security #Cryptography and Residue Arithmetic
4. Imperfect Forward Secrecy
   2015/10/06 by David Adrian, Karthikeyan Bhargavan, Zakir Durumeric +11 · 1 citation
   Computer Science · Engineering · #Cryptography and Data Security #Internet Traffic Analysis and Secure E-voting #IPv6, Mobility, Handover, Networks, Security