In mathematics the Function Field Sieve is one of the most efficient algorithms to solve the Discrete Logarithm Problem (DLP) in a finite field. It has heuristic subexponential complexity. Leonard Adleman developed it in 1994 and then elaborated it together with M. D. Huang in 1999. Previous work includes the work of D. Coppersmith about the DLP in fields of characteristic two.
The discrete logarithm problem in a finite field consists of solving the equation a x = b {\displaystyle a^{x}=b} for a , b ∈ F p n {\displaystyle a,b\in \mathbb {F} _{p^{n}}} , p {\displaystyle p} a prime number and n {\displaystyle n} an integer. The function f : F p n → F p n , a ↦ a x {\displaystyle f:\mathbb {F} _{p^{n}}\to \mathbb {F} _{p^{n}},a\mapsto a^{x}} for a fixed x ∈ N {\displaystyle x\in \mathbb {N} } is a one-way function used in cryptography. Several cryptographic methods are based on the DLP such as the Diffie-Hellman key exchange, the El Gamal cryptosystem and the Digital Signature Algorithm.