Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic

06/25/2019

∙

We prove that the discrete logarithm problem can be solved in quasi-polynomial expected time in the multiplicative group of finite fields of fixed characteristic. More generally, we prove that it can be solved in the field of cardinality p^n in expected time (pn)^2_2(n) + O(1).

READ FULL TEXT

Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic

Quasi-planar monomials over finite fields

Algorithms based on *-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing

On Dualization over Distributive Lattices

Generalized threshold arrangements

Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms

Fast Hermite interpolation and evaluation over finite fields of characteristic two

Computing a Group Action from the Class Field Theory of Imaginary Hyperelliptic Function Fields

Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic

Related Research

Quasi-planar monomials over finite fields

Algorithms based on *-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing

On Dualization over Distributive Lattices

Generalized threshold arrangements

Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms

Fast Hermite interpolation and evaluation over finite fields of characteristic two

Computing a Group Action from the Class Field Theory of Imaginary Hyperelliptic Function Fields