Computing Atlas

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

Key Exchange Protocols

Protocols that let two parties agree on a shared secret key over a channel that others can watch. The Diffie-Hellman key exchange, published in 1976, gets its security from the difficulty of the discrete logarithm problem, and its elliptic-curve form, ECDH, achieves similar security with much shorter keys. The shared key is then used with a symmetric cipher to protect the messages that follow, which is how secure web connections and many messaging systems begin.

Key Exchange Protocols
Filter Results2 entries
Sources
IETF RFC Editor: RFC 7748: Elliptic Curves for Security
IETF RFC EditorHas Member: Elliptic-Curve Diffie-Hellman, Introduction
Quote, Has Member: Elliptic-Curve Diffie-Hellman, Introduction
This memo also specifies how these curves can be used with the Diffie-Hellman protocol for key agreement.
View the Source
IETF RFC Editor: RFC 2631: Diffie-Hellman Key Agreement Method
IETF RFC EditorHas Member: Diffie-Hellman Key Exchange Algorithm, Section 1
Quote, Has Member: Diffie-Hellman Key Exchange Algorithm, Section 1
Diffie-Hellman is a key agreement algorithm used by two parties to agree on a shared secret.
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.