A method for determining logarithms in GF (2^n) is presented. Its asymptotic running time is O ( (cn^1/3 ^2/3 n) ) for a small constant c, while, by comparison, Adleman's scheme runs in time O ( (c^'n^1/2 ^1/2 n) ). The ideas give a dramatic improvement even for moderate-sized fields such as GF (2^127), and make (barely) possible computations in fields of size around 2^400. The method is not applicable to GF (q) for a large prime q.
Don Coppersmith (Sun,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: