Abstract
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 slightly 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.
Cite
CITATION STYLE
Schroeppel, R., Orman, H., O’Malley, S., & Spatscheck, O. (1995). Fast key exchange with elliptic curve systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 963, pp. 43–56). Springer Verlag. https://doi.org/10.1007/3-540-44750-4_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
