[43324] in Cypherpunks
Re: Diffie-Hellman in GF(2^n)?
daemon@ATHENA.MIT.EDU (Carl Ellison)
Mon Nov 13 11:00:57 1995
Date: Mon, 13 Nov 95 10:48:49 EST
From: Carl Ellison <cme@TIS.COM>
To: daw@cs.berkeley.edu
Cc: cypherpunks@toad.com
In-Reply-To: David A Wagner's message of Sun, 12 Nov 1995 14:43:53 -0800 (PST) <199511130525.VAA21438@comsec.com>
>From: David A Wagner <daw@CS.Berkeley.EDU>
>Date: Sun, 12 Nov 1995 14:43:53 -0800 (PST)
>``Hence the fields GF(2^n) out to be avoided in all cryptographic
>applications.''
I wonder what this implies about elliptic curve applications over
GF(2^n)...
