Elliptic Curve Cryptosystems.

Koblitz, N. (1987). Elliptic Curve Cryptosystems. Mathematics of Computation, 48(177), 203-209.

Type

Journal article

Intellectual base

Primary research

Year

1987

Volume

48

Issue

177

Pages

203-209

ISSN

0025-5718

DOI

10.1090/s0025-5718-1987-0866109-5

DOI registrant

American Mathematical Society

Link

https://doi.org/10.1090/S0025-5718-1987-0866109-5

Cited from

mathematics

Cited by

1 citation across 1 artifact.

Each citation links to the sentence it supports in the citing article.

Primes

• Group
  • In cryptography, discrete-logarithm and elliptic-curve groups underpin Diffie–Hellman, DSA, and ECDH.

    This sourceIntroduces elliptic-curve groups for cryptography, the discrete-logarithm hardness and the role of group order in parameter choice.

    Supported in partVerified against the publisher's abstract

    Abstract shows elliptic-curve groups proposed as analogs of discrete-log public-key cryptosystems, without naming Diffie-Hellman, DSA or ECDH.

    “We discuss analogs based on elliptic curves over finite fields of public key cryptosystems which use the multiplicative group of a finite field.”

    Read by an automated reader; not a human review. How support was checked

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Read against the text for 1 of 1 citation: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:35f675f0ea9a · see in the full table