Sciweavers

Share
CRYPTO
1995
Springer

Fast Key Exchange with Elliptic Curve Systems

11 years 10 months ago
Fast Key Exchange with Elliptic Curve Systems
The Diffie-Hellman key exchange algorithm can be implemented using the group of points on an elliptic curve over the field F2n. A software version of this using n = 155 can be optimized to achieve computation rates that are significantly faster than non-elliptic curve versions with a similar level of security. The fast computation of reciprocals in F2n is the key to the highly efficient implementation described here. March 31, 1995 Department of Computer Science The University of Arizona Tucson, AZ 85721
Richard Schroeppel, Hilarie K. Orman, Sean W. O'Ma
Added 25 Aug 2010
Updated 25 Aug 2010
Type Conference
Year 1995
Where CRYPTO
Authors Richard Schroeppel, Hilarie K. Orman, Sean W. O'Malley, Oliver Spatscheck
Comments (0)
books