Emmanuel Thomé

Available identifiers

zbMath Open thome.emmanuelMaRDI QIDQ697495

List of research outcomes

Publication	Date of Publication	Type
The Block Lanczos Algorithm	2023-04-21	Paper
Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment	2022-11-09	Paper
History of Cryptographic Key Sizes	2022-02-25	Paper
Refined Analysis of the Asymptotic Complexity of the Number Field Sieve	2020-07-06	Paper
Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation	2020-05-21	Paper
Isogeny graphs with maximal real multiplication	2019-10-17	Paper
Fast integer multiplication using generalized Fermat primes	2019-01-31	Paper
Computing discrete logarithms in \(\mathbb F_{p^6}\)	2018-04-26	Paper
Solving discrete logarithms on a 170-bit MNT curve by pairing reduction	2018-02-16	Paper
A Kilobit Hidden SNFS Discrete Logarithm Computation	2017-06-13	Paper
Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix	2017-05-10	Paper
Computing theta functions in quasi-linear time in genus two and above	2017-04-04	Paper
Fast computation of linear generators for matrix sequences and application to the block Wiedemann algorithm	2017-02-03	Paper
Root optimization of polynomials in the number field sieve	2015-07-20	Paper
Computing Class Polynomials for Abelian Surfaces	2014-08-08	Paper
A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic	2014-05-27	Paper
https://portal.mardi4nfdi.de/entity/Q5413906	2014-05-02	Paper
Discrete Logarithm in GF(2809) with FFS	2014-03-25	Paper
Universal Security	2013-12-10	Paper
A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic	2013-06-18	Paper
Square Root Algorithms for the Number Field Sieve	2012-11-01	Paper
An \(L(1/3)\) discrete logarithm algorithm for low degree curves	2011-04-01	Paper
Factorization of a 768-Bit RSA Modulus	2010-08-24	Paper
Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms	2010-01-07	Paper
Mapping Computation with No Memory	2009-10-22	Paper
Index calculus in class groups of non-hyperelliptic curves of genus three	2009-06-08	Paper
https://portal.mardi4nfdi.de/entity/Q5301655	2009-01-20	Paper
Faster Multiplication in GF(2)[x]	2008-05-27	Paper
When e-th Roots Become Easier Than Factoring	2008-05-15	Paper
A double large prime variation for small genus hyperelliptic index calculus	2007-02-02	Paper
https://portal.mardi4nfdi.de/entity/Q4474168	2004-08-04	Paper
Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm	2002-09-17	Paper

Research outcomes over time

This page was built for person: Emmanuel Thomé