25 citations · 66 across the 10 of their papers we have counts for
4 papers · 1 filter
A kilobit hidden SNFS discrete logarithm computation
Joshua Fried, Pierrick Gaudry, Nadia Heninger +1
We perform a special number field sieve discrete logarithm computation in a 1024-bit prime field. To our knowledge, this is the first kilobit-sized discrete logarithm computation e…
Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
Aurore Guillevic, François Morain, Emmanuel Thomé
Pairing based cryptography is in a dangerous position following the breakthroughs on discrete logarithms computations in finite fields of small characteristic. Remaining instances…
A modified block Lanczos algorithm with fewer vectors
Emmanuel Thomé
The block Lanczos algorithm proposed by Peter Montgomery is an efficient means to tackle the sparse linear algebra problem which arises in the context of the number field sieve fac…
Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix
Jean-Guillaume Dumas, Erich Kaltofen, Emmanuel Thomé +1
Computational problem certificates are additional data structures for each output, which can be used by a-possibly randomized-verification algorithm that proves the correctness of…