TO COMPUTE LOGARITHMS IN FINITE FIELDS
Oliver Schirokauer · 2016
We describe an adaptation of the number field sieve to the problem of computing logarithms in a finite field. We conjecture that the running time of the algorithm, when restricted to finite fields of an arbitrary but fixed degree, is Lq(l/3; (64/9)1/3 + o(1)), where q is the cardinality of the field,