Construct · 1 fields · 1 citations

elliptic curve cryptography: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
elliptic curvecryptography1 CONSTRUCTElliptic curveKOBLITZ · CRYPTOGRAPHY

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Cryptography

public-key cryptography based on the hardness of the discrete logarithm problem in groups of points on elliptic curves.

In cryptography, elliptic curve cryptography refers to public-key cryptography based on the hardness of the discrete logarithm problem in groups of points on elliptic curves. This meaning comes from Koblitz (1987) in Mathematics of Computation.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how elliptic curve cryptography sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

hardness4 fields · 4 citationsjingle · one word, four constructspublic-key cryptography1 fields · 1 citationsanchor · a standalone construct

References

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

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct