The Function Field Sieve in GF(2^n)

Antoine Joux
Crypto Lab

In this talk, we study the problem of computing discrete
logarithms in GF(2^n) using Adleman's Function field sieve. We show that
both from a practical and an asymptotical point of view, this algorithm is
faster than Coppersmith's algorithm. We illustrate it with computations in

Back to Contemporary Methods in Cryptography