Scribd
Upload
37 views9 pages

Diffie-Hellman: Secure Key Exchange 1976

The Diffie-Hellman key exchange protocol allows two parties to share a secret key over an insecure channel by using public key cryptography. Alice and Bob agree on numbers n and g, then Alice chooses a secret x and Bob a secret y. They exchange gx and gy to calculate the shared secret key k, which only they know due to the discrete logarithm problem. The key can be used to encrypt messages but does not authenticate the parties.

Uploaded by

Sneha_Mittal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
37 views9 pages

Diffie-Hellman: Secure Key Exchange 1976

The Diffie-Hellman key exchange protocol allows two parties to share a secret key over an insecure channel by using public key cryptography. Alice and Bob agree on numbers n and g, then Alice chooses a secret x and Bob a secret y. They exchange gx and gy to calculate the shared secret key k, which only they know due to the discrete logarithm problem. The key can be used to encrypt messages but does not authenticate the parties.

Uploaded by

Sneha_Mittal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 9

Diffie-Hellman

Secure Key Exchange


1976
Whitfield Diffie Martin Hellman
Alice & Bob
Agree on 2 numbers n and g
g is primitive relative mod (n)
For each x < n, there is an a such that
ga = x mod (n)

These do not have to kept secret


Alice
Chooses a large random number x
Calculates
X = gx mod (n)

Sends X, g, and n to Bob.


Bob
Chooses a large random number y
Calculates
Y = gy mod (n)

Sends Y to Alice.
Alice
Calculates

k = Yx mod (n)
Bob
Calculates

k = Xy mod (n)
The Key
k = k is the shared key

k = Yx mod (n) = (gy )x mod (n) = gyx mod (n)

k = Xy mod (n) = (gx )y mod (n) = gxy mod (n)

Nobody can calculate k given


n, g, X, and Y
The Key
Only Alice and Bob know k
Good for only one session
Cant be sure connected to the same person
Used if you only want a symmetric key
No authentication

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy