by Ciro Santilli (@cirosantilli, 35)
The algorithm is completely analogous to Diffie-Hellman key exchange in that you efficiently raise a number to a power times and send the result over while keeping 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 1.
Elliptic curves by Computerphile (2018)
Source. youtu.be/NF1pwjL9-DE?t=143 shows the continuous group well, but then fails to explain the discrete part.
ECDH has smaller keys. youtu.be/gAtBM06xwaw?t=634 mentions some interesting downsides:

Ancestors (10)

  1. Elliptic curve cryptography
  2. Public-key cryptography
  3. Symmetric and public-key cryptography
  4. Cryptography
  5. Computer science
  6. Computer
  7. Information technology
  8. Area of technology
  9. Technology
  10. Home

Incoming links (1)

Synonyms (1)

View article source

Discussion (0)

+ New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic + Create my own version