Emmanuel Thomé

From MaRDI portal
Person:697495

Available identifiers

zbMath Open thome.emmanuelMaRDI QIDQ697495

List of research outcomes

PublicationDate of PublicationType
The Block Lanczos Algorithm2023-04-21Paper
Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment2022-11-09Paper
History of Cryptographic Key Sizes2022-02-25Paper
Refined Analysis of the Asymptotic Complexity of the Number Field Sieve2020-07-06Paper
Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation2020-05-21Paper
Isogeny graphs with maximal real multiplication2019-10-17Paper
Fast integer multiplication using generalized Fermat primes2019-01-31Paper
Computing discrete logarithms in \(\mathbb F_{p^6}\)2018-04-26Paper
Solving discrete logarithms on a 170-bit MNT curve by pairing reduction2018-02-16Paper
A Kilobit Hidden SNFS Discrete Logarithm Computation2017-06-13Paper
Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix2017-05-10Paper
Computing theta functions in quasi-linear time in genus two and above2017-04-04Paper
Fast computation of linear generators for matrix sequences and application to the block Wiedemann algorithm2017-02-03Paper
Root optimization of polynomials in the number field sieve2015-07-20Paper
Computing Class Polynomials for Abelian Surfaces2014-08-08Paper
A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic2014-05-27Paper
https://portal.mardi4nfdi.de/entity/Q54139062014-05-02Paper
Discrete Logarithm in GF(2809) with FFS2014-03-25Paper
Universal Security2013-12-10Paper
A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic2013-06-18Paper
Square Root Algorithms for the Number Field Sieve2012-11-01Paper
An \(L(1/3)\) discrete logarithm algorithm for low degree curves2011-04-01Paper
Factorization of a 768-Bit RSA Modulus2010-08-24Paper
Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms2010-01-07Paper
Mapping Computation with No Memory2009-10-22Paper
Index calculus in class groups of non-hyperelliptic curves of genus three2009-06-08Paper
https://portal.mardi4nfdi.de/entity/Q53016552009-01-20Paper
Faster Multiplication in GF(2)[x]2008-05-27Paper
When e-th Roots Become Easier Than Factoring2008-05-15Paper
A double large prime variation for small genus hyperelliptic index calculus2007-02-02Paper
https://portal.mardi4nfdi.de/entity/Q44741682004-08-04Paper
Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm2002-09-17Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Emmanuel Thomé