Skip to content

Elliptic Curve Cryptosystems

Neal Koblitz

Mathematics of Computation · 1987 · 5,772 citationsOpen access

No retraction on record in OpenAlex.Check Crossref now

Cite this paper

Koblitz, N. (1987). Elliptic curve cryptosystems. Mathematics of Computation, 48(177), 203. https://doi.org/10.1090/s0025-5718-1987-0866109-5

In text: (Koblitz, 1987)

Ask a question about this research

One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.

Abstract

We discuss analogs based on elliptic curves over finite fields of public key cryptosystems which use the multiplicative group of a finite field. These elliptic curve cryptosystems may be more secure, because the analog of the discrete logarithm problem on elliptic curves is likely to be harder than the classical discrete logarithm problem, especially over ${\text {GF}}({2^n})$. We discuss the question of primitive points on an elliptic curve modulo p, and give a theorem on nonsmoothness of the order of the cyclic subgroup generated by a global point.

  1. New directions in cryptography1976
  2. A method for obtaining digital signatures and public-key cryptosystems1978
  3. How to share a secret1979
  4. A method for obtaining digital signatures and public-key cryptosystems1983
  5. Federated Machine Learning2019

Metadata from OpenAlex (CC0). Citations are generated from the published record.