Use of Elliptic Curves in Cryptography

  • Victor S. Miller
Conference paper

DOI: 10.1007/3-540-39799-X_31

Part of the Lecture Notes in Computer Science book series (LNCS, volume 218)
Cite this paper as:
Miller V.S. (1986) Use of Elliptic Curves in Cryptography. In: Williams H.C. (eds) Advances in Cryptology — CRYPTO ’85 Proceedings. CRYPTO 1985. Lecture Notes in Computer Science, vol 218. Springer, Berlin, Heidelberg

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.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Victor S. Miller
    • 1
  1. 1.Exploratory Computer ScienceIBM ResearchYorktown Heights

Personalised recommendations