Scribd
Upload
45 views7 pages

7 - Diffie-Hellman Key Exchange

The Diffie-Hellman key exchange algorithm allows two users to securely exchange a key over an insecure channel by using public key cryptography. It works by having each user generate a public/private key pair, where the public keys are exchanged and each user uses both public keys along with their private key to compute a shared secret key. While the algorithm securely establishes a shared key, it is vulnerable to man-in-the-middle attacks where an attacker intercepts the public key exchange and establishes separate secret keys with each user.

Uploaded by

kaka shipai
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
45 views7 pages

7 - Diffie-Hellman Key Exchange

The Diffie-Hellman key exchange algorithm allows two users to securely exchange a key over an insecure channel by using public key cryptography. It works by having each user generate a public/private key pair, where the public keys are exchanged and each user uses both public keys along with their private key to compute a shared secret key. While the algorithm securely establishes a shared key, it is vulnerable to man-in-the-middle attacks where an attacker intercepts the public key exchange and establishes separate secret keys with each user.

Uploaded by

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

Diffie–Hellman Key Exchange

Nauman H. Ansari
Spring 2019 - MAJU
Diffie–Hellman Key Exchange
The purpose of the algorithm is to enable two users to securely exchange a key that can then
be used for subsequent symmetric encryption of messages. The algorithm itself is limited to
the exchange of secret values. A number of commercial products employ this key exchange
technique.
Primitive Roots
The Algorithm

Key Exchange Protocols


Figure 10.1 shows a simple protocol that makes use of the Diffie–
Hellman calculation. Suppose that user A wishes to set up a connection
with user B and use a secret key to encrypt messages on that
connection. User A can generate a one-time private key XA, calculate
YA, and send that to user B. User B responds by generating a private
value XB, calculating YB, and sending YB to user A. Both users can
now calculate the key. The necessary public values q and a would
need to be known ahead of time. Alternatively, user A could pick values
Diffie–Hellman Key Exchange - Example
Man-in-the-Middle Attack
Review Questions

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