Abstract
We discuss the use of elliptic curves in cryptography. In particular, we propose an analogue of the Diffie-Hellmann key exchange protocol which appears to be immune from attacks of the style of Western, Miller, and Adleman. With the current bounds for infeasible attack, it appears to be about 20% faster than the Diffie-Hellmann scheme over GF(p). As computational power grows, this disparity should get rapidly bigger.
Cite
CITATION STYLE
Miller, V. S. (1986). Use of Elliptic Curves in Cryptography. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 218 LNCS, pp. 417–426). Springer Verlag. https://doi.org/10.1007/3-540-39799-X_31
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
