Skip to Main Content
A method for determining logarithms in GF is presented. Its asymptotic running time is for a small constant , while, by comparison, Adleman's scheme runs in time . The ideas give a dramatic improvement even for moderate-sized fields such as GF , and make (barely) possible computations in fields of size around . The method is not applicable to GF for a large prime .