25 citations · 27 across the 8 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
quant-ph2019★ 1 cited
Discrete logarithm and Diffie-Hellman problems in identity black-box groups
Gabor Ivanyos, Antoine Joux, Miklos Santha
We investigate the computational complexity of the discrete logarithm, the computational Diffie-Hellman and the decisional Diffie-Hellman problems in some identity black-box groups…
cs.CR2019
Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms
Antoine Joux, Cecile Pierrot
Elliptic bases, introduced by Couveignes and Lercier in 2009, give an elegant way of representing finite field extensions. A natural question which seems to have been considered in…
cs.DS2019
Certified lattice reduction
Thomas Espitau, Antoine Joux
Quadratic form reduction and lattice reduction are fundamental tools in computational number theory and in computer science, especially in cryptography. The celebrated Lenstra-Lens…