Bill Frantz (frantz@netcom.com)
Wed, 8 Apr 1998 09:52:14 -0800
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?
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
-------------------------------------------------------------------------
Bill Frantz | If hate must be my prison | Periwinkle -- Consulting
(408)356-8506 | lock, then love must be | 16345 Englewood Ave.
frantz@netcom.com | the key. - Phil Ochs | Los Gatos, CA 95032, USA
The following archive was created by hippie-mail 7.98617-22 on Fri Aug 21 1998 - 17:16:55 ADT