A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic
Authors:
Preprint
Abstract
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 result gives a quasi-polynomial heuristic complexity for the discrete logarithm problem in finite field of small characteristic. By quasi-polynomial, we mean a complexity of type $n^{O(\log n)}$ where $n$ is the bit-size of the cardinality of the finite field. Such a complexity is smaller than any $L(\varepsilon)$ for $\epsilon>0$. It remains super-polynomial in the size of the input, but offers a major asymptotic improvement compared to $L(1/4+o(1))$.
Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- Traps to the BGJT-algorithm for discrete logarithmsLMS Journal of Computation and Mathematics, 2014
- A New Index Calculus Algorithm with Complexity $L(1/4+o(1))$ in Small Characteristic2014
- Discrete Logarithms in $GF ( P )$ Using the Number Field SieveSIAM Journal on Discrete Mathematics, 1993
- Fast evaluation of logarithms in fields of characteristic twoIEEE Transactions on Information Theory, 1984
- Computing Logarithms in Finite Fields of Characteristic TwoSIAM Journal on Algebraic Discrete Methods, 1984
- An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)IEEE Transactions on Information Theory, 1978
- New directions in cryptographyIEEE Transactions on Information Theory, 1976