Elliptic curve cryptography
flowchart AA["Associated Authors (0)"] C[Elliptic curve cryptography] BC["Broader Concepts (1)"] NC["Narrower Concepts (8)"] C== skos:broader ==>BC NC== skos:broader ==>C AA== dcterms:relation ==>C click BC "#broader-concepts" click NC "#narrower-concepts" click AA "#associated-authors" NI["add incoming edge"] NO["add outgoing edge"] NI-- ? -->C C-- ? -->NO click NI "#add-incoming-edge" click NO "#add-outgoing-edge" style NI stroke-width:2px,stroke-dasharray: 5 5 style NO stroke-width:2px,stroke-dasharray: 5 5
- Wikidata
- https://www.wikidata.org/wiki/Q1048911
- OpenAlex ID
- https://openalex.org/C167615521 (API record)
- OpenAlex Description
- approach to public-key cryptography based on the algebraic structure of elliptic curves over finite fields
- OpenAlex Level [?]
- 4
Broader Concepts
Narrower Concepts
- Counting points on elliptic curves
- Curve25519
- Edwards curve
- Elliptic Curve Digital Signature Algorithm
- Hessian form of an elliptic curve
- Hyperelliptic curve cryptography
- Jacobian curve
- Tripling-oriented Doche–Icart–Kohel curve
Associated Authors
Add Incoming Edge
Login via ORCiD to contribute.
Add Outgoing Edge
Login via ORCiD to contribute.