Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Elliptic-Curve Diffie-Hellman

Cryptographic Algorithm

Elliptic-curve Diffie-Hellman, or ECDH, is a key agreement protocol that lets two parties, each holding an elliptic-curve public-private key pair, establish a shared secret over an insecure channel. The resulting shared secret can be used directly as a key or to derive one for a symmetric-key cipher, and the protocol is a variant of the original Diffie-Hellman method adapted to elliptic-curve cryptography.

Facts
Time Complexity
Time Complexity (category)
Polynomial Time -- O(n^k) 1
Connections

Built On

Elliptic-curve Diffie-Hellman adapts the Diffie-Hellman key exchange to elliptic curve groups, a variant credited to Victor Miller and Neal Koblitz in 1985.

Sources
1. Elliptic-Curve Diffie-Hellman (Wikipedia)
Wikipedia infobox: time complexity polynomial
Quote, Wikipedia infobox: time complexity polynomial
polynomial
View the Source
IETF RFC Editor: RFC 7748: Elliptic Curves for Security
IETF RFC EditorIn Group: Key Exchange Protocols, Introduction
Quote, In Group: Key Exchange Protocols, Introduction
This memo also specifies how these curves can be used with the Diffie-Hellman protocol for key agreement.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.