IACR News item: 21 February 2013
Antoine Joux
ePrint Report
In this paper, we describe a new algorithm for discrete logarithms in
small characteristic. It works especially well when the characteristic
is fixed. Indeed, in this case, we obtain a total complexity of $L(1/4+o(1)).$
Additional news items may be found on the IACR news page.