David Jablon (dpj@world.std.com)
Wed, 08 Apr 1998 20:22:22 -0400
Here's an alternate introduction to EC crypto, which I
intended to be a little more accessible than Certicom's:
<http://world.std.com/~dpj/elliptic.html>
Any feedback from experts or novices is appreciated.
At 7:33 AM -0800 4/8/98, Kriston J. Rehberg wrote:
>>Pardon the question, but does Elliptic Curve Cryptography avoid the
>>the use of large primes, or does it merely make them fantastically
>>large?
ECC uses arithmetic modulo large primes, or other special numbers,
but the modulus is smaller than in RSA or Diffie-Hellman.
At 09:52 AM 4/8/98 -0800, Bill Frantz wrote:
>Elliptic curve cryptography uses a different mathematical base than the
>modular arithmetic used by the prime based systems. For more information
>about it see http://www.certicom.com/ecc/enter/index.htm (my candidate for
>best use of Java applets on the web.)
>
>In fairness, I understand that RSA disputes the security of Elliptic curve
>cryptography. Their stuff is probably available thru their web page
>http://www.rsa.com
Still, many researchers at RSA DSI privately speak against the
overly negative marketing spin against ECC found on their web page.
Hey, RSA DSI even announced plans to support ECC in BSAFE.
They certainly wouldn't do that for snake-oil.
------------------------------------
David Jablon
dpj@world.std.com
<http://world.std.com/~dpj/>
The following archive was created by hippie-mail 7.98617-22 on Fri Aug 21 1998 - 17:16:55 ADT