[43239] in Cypherpunks
Diffie-Hellman in GF(2^n)?
daemon@ATHENA.MIT.EDU (Wei Dai)
Fri Nov 10 22:09:27 1995
Date: Fri, 10 Nov 1995 19:01:26 -0800 (PST)
From: Wei Dai <weidai@eskimo.com>
To: Cypherpunks <cypherpunks@toad.com>
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
