25 citations · 66 across the 10 of their papers we have counts for
Showing 2016 · cs.CRShow all
3 papers · 2 filters
cs.CR2016★ 25 cited
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…
cs.CR2016
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…
cs.CR2016★ 2 cited
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…