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

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

To: [email protected]
Subject: Re: Diffie-Hellman in GF(2^n)?
From: Carl Ellison <[email protected]>
Date: Mon, 13 Nov 95 10:48:49 EST
Cc: [email protected]
In-Reply-To: David A Wagner's message of Sun, 12 Nov 1995 14:43:53 -0800 (PST) <[email protected]>
Sender: [email protected]

>From: David A Wagner <[email protected]>
>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