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

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)...