Function Field Sieve Method for Discrete Logarithms over Finite Fields

We present a function field sieve method for discrete logarithms over finite fields. This method is an analog of the number field sieve method originally developed for factoring integers. It is asymptotically faster than the previously known algorithms when applied to finite fields F_pⁿ, where p⁶n.