Scribd
Upload
351 views9 pages

Diffie-Hellman Key Exchange Guide

The Diffie-Hellman key exchange algorithm allows two users to securely exchange a key over an insecure channel by using discrete logarithm problems. It works by having both users choose a private value and calculating a public value using a prime number and primitive root that are publicly known. Neither user's private value can be determined by their public values alone, preventing third parties from calculating the shared secret key. However, it is vulnerable to man-in-the-middle attacks without authentication.

Uploaded by

kanna karthik reddy
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
351 views9 pages

Diffie-Hellman Key Exchange Guide

The Diffie-Hellman key exchange algorithm allows two users to securely exchange a key over an insecure channel by using discrete logarithm problems. It works by having both users choose a private value and calculating a public value using a prime number and primitive root that are publicly known. Neither user's private value can be determined by their public values alone, preventing third parties from calculating the shared secret key. However, it is vulnerable to man-in-the-middle attacks without authentication.

Uploaded by

kanna karthik reddy
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/ 9

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 encryption of messages.
 The Diffie-Hellman algorithm depends for its
effectiveness on the difficulty of computing
discrete logarithms.
Diffie-Hellman Key Exchange
 if  is a primitive root of the prime number p , then the
numbers  mod p, 2 mod p, ... ,  p-1 mod p are
distinct and consist of the integers from 1 through p-1
in some permutation.
 For any integer b and a primitive root  of prime
number p, we can find a unique exponent i such that b
=  i (mod p) where 0 ≤i  (p - 1) .
 The exponent i is referred to as the discrete logarithm
of b for the base  , mod p .
 We express this value as dlog ,p (b).
Diffie-Hellman Key Exchange
 For this scheme, there are two publicly known
numbers:
 A prime number q
 An integer  that is a primitive root of q.

 Suppose the users A and B wish to exchange a key.


The Diffie-Hellman Key Exchange Algorithm
Key Exchange Protocols
Example
Man-in-the-Middle Attack
Man-in-the-Middle Attack
Man-in-the-Middle Attack
 The key exchange protocol is vulnerable to such an
attack because it does not authenticate the
participants.
 This vulnerability can be overcome with the use of
digital signatures and public-key certificates.

You might also like