We present a function field sieve method for discrete logarithms over finit
e fields. This method is an analog of the number field sieve method origina
lly developed for factoring integers. It is asymptotically faster than the
previously known algorithms when applied to finite fields F(p)n, where p(6)
less than or equal to n. (C) 1999 Academic Press.