Emmanuel Thomé

According to our database1, Emmanuel Thomé authored at least 62 papers between 2001 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Fast integer multiplication using \goodbreak generalized Fermat primes.
Math. Comput., 2019

Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation.
IACR Cryptology ePrint Archive, 2019

Imperfect forward secrecy: how Diffie-Hellman fails in practice.
Commun. ACM, 2019

2017
Computing Discrete Logarithms in 𝔽p6.
Proceedings of the Selected Areas in Cryptography - SAC 2017, 2017

A Kilobit Hidden SNFS Discrete Logarithm Computation.
Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

2016
A modified block Lanczos algorithm with fewer vectors.
IACR Cryptology ePrint Archive, 2016

Computing theta functions in quasi-linear time in genus 2 and above.
IACR Cryptology ePrint Archive, 2016

Solving discrete logarithms on a 170-bit MNT curve by pairing reduction.
IACR Cryptology ePrint Archive, 2016

A kilobit hidden SNFS discrete logarithm computation.
IACR Cryptology ePrint Archive, 2016

A modified block Lanczos algorithm with fewer vectors.
CoRR, 2016

Solving discrete logarithms on a 170-bit MNT curve by pairing reduction.
CoRR, 2016

A kilobit hidden SNFS discrete logarithm computation.
CoRR, 2016

Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix.
CoRR, 2016

Solving Discrete Logarithms on a 170-Bit MNT Curve by Pairing Reduction.
Proceedings of the Selected Areas in Cryptography - SAC 2016, 2016

Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix.
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

2015
Root optimization of polynomials in the number field sieve.
Math. Comput., 2015

Interactive certificate for the verification of Wiedemann's Krylov sequence: application to the certification of the determinant, the minimal and the characteristic polynomials of sparse matrices.
CoRR, 2015

Fast arithmetic for faster integer multiplication.
CoRR, 2015

Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice.
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

2014
Isogeny graphs with maximal real multiplication.
IACR Cryptology ePrint Archive, 2014

Computing Class Polynomials for Abelian Surfaces.
Experimental Mathematics, 2014

Computation with No Memory, and Rearrangeable Multicast Networks.
Discrete Mathematics & Theoretical Computer Science, 2014

Discrete Logarithm in GF(2809) with FFS.
Proceedings of the Public-Key Cryptography - PKC 2014, 2014

A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic.
Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

2013
Universal security; from bits and mips to pools, lakes - and beyond.
IACR Cryptology ePrint Archive, 2013

Computing class polynomials for abelian surfaces.
IACR Cryptology ePrint Archive, 2013

A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic.
IACR Cryptology ePrint Archive, 2013

Discrete logarithm in GF(2809) with FFS.
IACR Cryptology ePrint Archive, 2013

Computing class polynomials for abelian surfaces
CoRR, 2013

Computation with No Memory, and Rearrangeable Multicast Networks.
CoRR, 2013

A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic.
CoRR, 2013

Universal Security - From Bits and Mips to Pools, Lakes - and Beyond.
Proceedings of the Number Theory and Cryptography, 2013

2012
Factorisation of RSA-704 with CADO-NFS.
IACR Cryptology ePrint Archive, 2012

Root Optimization of Polynomials in the Number Field Sieve.
IACR Cryptology ePrint Archive, 2012

Root optimization of polynomials in the number field sieve
CoRR, 2012

A heterogeneous computing environment to solve the 768-bit RSA challenge.
Cluster Computing, 2012

Square Root Algorithms for the Number Field Sieve.
Proceedings of the Arithmetic of Finite Fields - 4th International Workshop, 2012

Théorie algorithmique des nombres et applications à la cryptanalyse de primitives cryptographiques. (Algorithmic Number Theory and Applications to the Cryptanalysis of Cryptographical Primitives).
, 2012

2011
Sieving in Function Fields.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Function Field Sieve.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

An L(1/3) Discrete Logarithm Algorithm for Low Degree Curves.
J. Cryptology, 2011

Ballot stuffing in a postal voting system.
Proceedings of the 2011 International Workshop on Requirements Engineering for Electronic Voting Systems, 2011

2010
Factorization of a 768-bit RSA modulus.
IACR Cryptology ePrint Archive, 2010

Using a grid platform for solving large sparse linear systems over GF(2).
Proceedings of the 2010 11th IEEE/ACM International Conference on Grid Computing, 2010


2009
An $L (1/3)$ Discrete Logarithm Algorithm for Low Degree Curves
CoRR, 2009

Abstracts of the CADO workshop on integer factorization.
ACM Comm. Computer Algebra, 2009

Mapping Computation with No Memory.
Proceedings of the Unconventional Computation, 8th International Conference, 2009

Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms.
Proceedings of the Cryptography and Coding, 2009

2008
Index Calculus in Class Groups of Non-hyperelliptic Curves of Genus Three.
J. Cryptology, 2008

Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms.
IACR Cryptology ePrint Archive, 2008

Faster Multiplication in GF(2)[x].
Proceedings of the Algorithmic Number Theory, 8th International Symposium, 2008

2007
A double large prime variation for small genus hyperelliptic index calculus.
Math. Comput., 2007

When e-th Roots Become Easier Than Factoring.
IACR Cryptology ePrint Archive, 2007

Time- and Space-Efficient Evaluation of Some Hypergeometric Constants
CoRR, 2007

Time-and space-efficient evaluation of some hypergeometric constants.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

When e-th Roots Become Easier Than Factoring.
Proceedings of the Advances in Cryptology, 2007

2004
A double large prime variation for small genus hyperelliptic index calculus.
IACR Cryptology ePrint Archive, 2004

2003
Algorithmes de calcul de logarithmes discrets dans les corps finis.
PhD thesis, 2003

2002
Subquadratic Computation of Vector Generating Polynomials and Improvement of the Block Wiedemann Algorithm.
J. Symb. Comput., 2002

2001
Fast computation of linear generators for matrix sequences and application to the block Wiedemann algorithm.
Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, 2001

Computation of Discrete Logarithms in F2607.
Proceedings of the Advances in Cryptology, 2001


  Loading...