25 citations · 83 across the 11 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.CR2013
A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic
Razvan Barbulescu, Pierrick Gaudry, Antoine Joux +1
In the present work, we present a new discrete logarithm algorithm, in the same vein as in recent works by Joux, using an asymptotically more efficient descent approach. The main r…
cs.SC2013★ 20 cited
Polynomial Systems Solving by Fast Linear Algebra
Jean-Charles Faugère, Pierrick Gaudry, Louise Huot +1
Polynomial system solving is a classical problem in mathematics with a wide range of applications. This makes its complexity a fundamental problem in computer science. Depending on…