[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: Diffie-Hellman in GF(2^n)?

To: daw@cs.berkeley.edu
Subject: Re: Diffie-Hellman in GF(2^n)?
From: Carl Ellison <cme@TIS.COM>
Date: Mon, 13 Nov 95 10:48:49 EST
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>
Sender: owner-cypherpunks@toad.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)...

Prev by Date: [joke] Re: Who needs time vaults anyway?
Next by Date: Re: Lotus Notes RSA Implementation Question
Prev by thread: Diffie-Hellman in GF(2^n)?
Next by thread: Re: Diffie-Hellman in GF(2^n)?
Index(es):
- Date
- Thread