// COMPLETE THREAD

Diffie-Hellman in GF(2^n)?

1 expanded post · every known parent and child

NODE e349a320Diffie-Hellman in GF(2^n)? Wei Dai <weidai@eskimo.com>Fri, 10 Nov 95 19:01:29 PST

Most Diffie-Hellman implementations currently use the multiplicative group
of prime fields.  However, the multiplicative group of finite fields of
characteristic 2 (GF(2^n)) can also be used and should be easier to
implement.  Is there any reason why they should not be used?  Does anyone
know the asymptotic running time of the best algorithm for calculating
discrete logarithms in GF(2^n)? 

Wei Dai