7 citations · 11 across the 6 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.CR2013
Selecting polynomials for the Function Field Sieve
Razvan Barbulescu
The Function Field Sieve algorithm is dedicated to computing discrete logarithms in a finite field GF(q^n), where q is small an prime power. The scope of this article is to select…