= Elliptic-curve Diffie-Hellman
{c}
{wiki}
= ECDH
{c}
{synonym}
{title2}
The algorithm is completely analogous to <Diffie-Hellman key exchange> in that you efficiently raise a number to a power $n$ times and send the result over while keeping $n$ as private key.
The only difference is that a different group is used: instead of using the <cyclic group>, we use the <elliptic curve group> of an <elliptic curve over a finite field>.
\Video[https://www.youtube.com/watch?v=NF1pwjL9-DE]
{title=<Elliptic curves> by <Computerphile> (2018)}
{description=https://youtu.be/NF1pwjL9-DE?t=143 shows the continuous group well, but then fails to explain the discrete part.}
Variant of <Diffie-Hellman key exchange>{parent} based on <elliptic curve cryptography>.