liveBook · Manning

Elliptic-curve diffie-hellman

As explained in Hacking Cryptography

Elliptic Curve Diffie–Hellman is a key-agreement protocol that performs Diffie–Hellman operations with elliptic-curve points instead of modular exponentiation.

Elliptic Curve Diffie–Hellman (ECDH) is a key-agreement technique that applies the discrete-logarithm problem to elliptic curves. Instead of modular exponentiation, each participant repeatedly adds a generator point to itself; the resulting shared elliptic-curve point becomes the basis for a shared secret. section 8.3.1

ECDH follows the Diffie–Hellman pattern: participants exchange public values while keeping private scalars secret, then independently derive the same shared result. ECDH is identified as the primary key-exchange method in TLS 1.3; an ephemeral variant provides perfect forward secrecy, but its details are deferred. section 8.3.1

How Hacking Cryptography covers it

How deep it goes
Defines the arithmetic substitution and protocol role, but defers ephemeral ECDH and perfect-forward-secrecy details.
Examples
Contrasts elliptic-curve point addition with modular exponentiation and situates ECDH in TLS 1.3.
What it assumes
Assumes familiarity with Diffie–Hellman key exchange, discrete logarithms, and elliptic-curve point operations.
What you can do after
Evaluate/understand how elliptic-curve arithmetic adapts Diffie–Hellman key agreement for TLS 1.3.
How it connects
Connects elliptic curves with Diffie–Hellman key exchange, the discrete logarithm problem, TLS 1.3, and perfect forward secrecy.

Also explained in

Compare how 3 books explain elliptic-curve diffie-hellman →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Hacking Cryptography. The section links point to the parts of the book it draws on.