From: Wei Dai <weidai@eskimo.com>
Date: Fri, 10 Nov 95 19:01:29 PST
To: Cypherpunks <cypherpunks@toad.com>
Subject: Diffie-Hellman in GF(2^n)?
Message-ID: <Pine.SUN.3.91.951110184600.19312B-100000@eskimo.com>
MIME-Version: 1.0
Content-Type: text/plain


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