Re: Diffie-Hellman in GF(2^n)?
17 Dec
2003
17 Dec
'03
11:17 p.m.
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)...
8167
Age (days ago)
8167
Last active (days ago)
0 comments
1 participants
participants (1)
-
Carl Ellison