1995-11-27 - Re: Elliptic curves, current status?

Header Data

From: Wei Dai <weidai@eskimo.com>
To: Norman Hardy <norm@netcom.com>
Message Hash: 29cf36fc29e34fc00b54f530200b32df2d0e1b4dd8c1373365b7754486eb12b5
Message ID: <Pine.SUN.3.91.951126213017.7378B-100000@eskimo.com>
Reply To: <acde968205021004b44c@DialupEudora>
UTC Datetime: 1995-11-27 05:59:37 UTC
Raw Date: Mon, 27 Nov 1995 13:59:37 +0800

Raw message

From: Wei Dai <weidai@eskimo.com>
Date: Mon, 27 Nov 1995 13:59:37 +0800
To: Norman Hardy <norm@netcom.com>
Subject: Re: Elliptic curves, current status?
In-Reply-To: <acde968205021004b44c@DialupEudora>
Message-ID: <Pine.SUN.3.91.951126213017.7378B-100000@eskimo.com>
MIME-Version: 1.0
Content-Type: text/plain


On Sun, 26 Nov 1995, Norman Hardy wrote:

> There are many parameters to an elliptic curve crypto system.
> I haven't seen any taxonomy of which kinds are good and which
> have been shown to be week. In contrast there seems to be a
> consensus about how to pick primes for RSA or Diffie-Hellman.

The IEEE p1363 group's working draft on elliptic curve standard may help 
you here.  You can find it at ftp://ftp.rsa.com/pub/p1363/draft/ec.ps

One reason for confusion about the speed of elliptic curve cryptosystems is 
the small number of implementations.  A paper in Crypto 95 claimed that 
for doing key exchange, an elliptic curve algorithm takes about the same 
time and has about the same level of security as DH with 512 bit modulus, 
and that elliptic curve has a speed advantage if greater security is 
desired.

Wei Dai






Thread