Elliptic-curve diffie-hellman
Elliptic-curve Diffie-Hellman is a public-key key-agreement method in which parties derive a shared secret through elliptic-curve point operations.
Real-World Cryptography
Elliptic Curve Diffie-Hellman is a public-key key exchange method based on elliptic-curve cryptography that lets parties derive a shared secret.
- How it is used
- Provides a compact public-key mechanism for deriving shared secrets in key exchanges and hybrid encryption.
- How deep it goes
- Explains parameter agreement, key generation, scalar operations, shared-secret equality, security assumptions, and key validation.
- Examples
- Uses Alice and Bob, base point G, P-256, Curve25519, and visual comparisons between ordinary DH and elliptic-curve groups.
- What you can do after
- Apply ECDH by selecting standardized curves, deriving matching shared secrets, validating public keys, and adding authentication where required.
Read how Real-World Cryptography explains elliptic-curve diffie-hellman →
Software Security for Developers
Elliptic-curve Diffie-Hellman is a Diffie-Hellman key-agreement algorithm based on the discrete-logarithm problem for points on elliptic curves.
- How it is used
- Generates shared symmetric keys for encrypted communication over insecure networks, including modern TLS deployments.
- How deep it goes
- Explains key exchange, security assumptions, curve selection, and deployment guidance but stops short of mathematical derivation.
- Examples
- Uses a payment service and warehouse service, public-key combinations, AES encryption, and approved curves such as Curve25519.
- What you can do after
- Configure ECDH through established secure protocols and select approved curves without implementing the underlying mathematics.
Read how Software Security for Developers explains elliptic-curve diffie-hellman →
Hacking Cryptography
Elliptic Curve Diffie–Hellman is a key-agreement protocol that performs Diffie–Hellman operations with elliptic-curve points instead of modular exponentiation.
- How it is used
- Uses elliptic-curve arithmetic to establish shared keys, especially as the primary key-exchange method in TLS 1.3.
- 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 you can do after
- Evaluate/understand how elliptic-curve arithmetic adapts Diffie–Hellman key agreement for TLS 1.3.
Read how Hacking Cryptography explains elliptic-curve diffie-hellman →
Also covered in
What to know first
- elliptic curveAn elliptic curve is a nonsingular algebraic curve defined by a cubic equation whose points, including a point at infinity, support a group operation.
- AESAES is a standardized symmetric block cipher that encrypts and decrypts data in 128-bit blocks using 128-, 192-, or 256-bit keys.
- Diffie–Hellman key exchangeDiffie–Hellman key exchange is a public-key key-agreement protocol that enables parties to derive a shared secret over an insecure channel without transmitting it.
- finite fieldA finite field is a field containing finitely many elements, with addition, subtraction, multiplication, and division by nonzero elements defined within it.
Related concepts
- Diffie–Hellman key exchangekind of · Diffie–Hellman key exchange is a public-key key-agreement protocol that enables parties to derive a shared secret over an insecure channel without transmitting it.
- cryptographic keyproduces · A cryptographic key is a value supplied to a cryptographic algorithm to control operations such as encryption, decryption, signing, authentication, or verification.
- key exchangekind of · Key exchange is a cryptographic protocol by which communicating parties establish a shared secret over a communication channel without directly transmitting that secret.
- elliptic curve point multiplicationuses · Elliptic-curve point multiplication multiplies a point by an integer scalar through repeated point addition and doubling.
- API keyproduces · An API key is a credential, usually represented as a string or token, presented with API requests to identify or authenticate a client and potentially authorize access.
Questions about elliptic-curve diffie-hellman
What is elliptic-curve diffie-hellman?
Elliptic-curve Diffie-Hellman is a public-key key-agreement method in which parties derive a shared secret through elliptic-curve point operations.
Which Manning books explain elliptic-curve diffie-hellman?
Real-World Cryptography, Software Security for Developers and Hacking Cryptography.
What should I know before learning elliptic-curve diffie-hellman?
Manning books that teach elliptic-curve diffie-hellman usually introduce elliptic curve, AES, Diffie–Hellman key exchange and finite field first.
What is elliptic-curve diffie-hellman a kind of?
Elliptic-curve diffie-hellman is a kind of Diffie–Hellman key exchange. Diffie–Hellman key exchange is a public-key key-agreement protocol that enables parties to derive a shared secret over an insecure channel without transmitting it.
What is elliptic-curve diffie-hellman also called?
Elliptic-curve diffie-hellman is also called ECDH.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.


