Scribd
Upload
197 views

Diffie Hellman Algorithm

Diffie-Hellman key exchange is a method for public key exchange that was first proposed in 1976. It allows two parties to establish a shared secret key over an unsecured communication channel. Each party generates a public/private key pair, and the exchange of the public keys allows them to jointly derive a shared secret key known only to them. This key can then be used to encrypt subsequent communications using a symmetric cipher. The Diffie-Hellman key exchange is vulnerable to man-in-the-middle attacks, where an attacker inserts themselves into the communication channel and is able to intercept messages between the two parties.

Uploaded by

joxy john
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
197 views

Diffie Hellman Algorithm

Diffie-Hellman key exchange is a method for public key exchange that was first proposed in 1976. It allows two parties to establish a shared secret key over an unsecured communication channel. Each party generates a public/private key pair, and the exchange of the public keys allows them to jointly derive a shared secret key known only to them. This key can then be used to encrypt subsequent communications using a symmetric cipher. The Diffie-Hellman key exchange is vulnerable to man-in-the-middle attacks, where an attacker inserts themselves into the communication channel and is able to intercept messages between the two parties.

Uploaded by

joxy john
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 11

DIFFIE HELLMAN

ALGORITHM
BY
JOXYJOHN
S2-MCOME
Roll.No:09
DIFFIE-HELLMAN KEY
EXCHANGE
 firstpublic-key type scheme proposed
 by Diffie & Hellman in 1976 along with the exposition of public
key concepts
 NOTE: now know that Williamson (UK CESG) secretly

proposed the concept in 1970


 is a practical method for public exchange of a secret key
 used in a number of commercial products
DIFFIE-HELLMAN KEY
EXCHANGE
 For sharing secret over an unsecured communication channel.
 Also known as exponential key exchange.
 It allows sender and receiver to share the secret key-not known to
third person.
 Only used for sharing secret key between the sender & Receiver.
 The private key is used by both sender & Receiver for their
symmetric key encryption algorithm.
DEFFIE HELLMAN KEY EXCHANGE
ALGORITHM
• A and B want to agree on a secret key
They agree on two large numbers n and g such that g<n.
S chooses random x, computes A=𝑔 𝑥 mod n
S Sends A to R.
R chooses random y, computes B=𝑔 𝑦 mod n
R Sends B to S.
S computes K1, K1=𝐵 𝑥 mod n
R computes K2, K2=𝐴 𝑦 mod n
Privat
e key

Publ
ic
key

Sh
ar
ed
ke
y
DIFFIE-HELLMAN KEY
EXCHANGE

 In practical applications ,these numbers are very large.


 It allows sender and receiver to share the secret key-not known to
third person.
 Only used for sharing secret key between the sender & Receiver.
 The private key is used by both sender & Receiver for their
symmetric key encryption algorithm.
DIFFIE-HELLMAN KEY
EXCHANGE

 Capital A &B is known to hacker but not x and y-no hacking.


 Only to share secret key using which the encryption and
decryption can be done.
Masquerader-Exploits a legitimate user’s account
Man-in-the-Middle Attack
1. Darth prepares by creating two private / public keys
2. Alice transmits her public key to Bob
3. Darth intercepts this and transmits his first public key to Bob. Darth also
calculates a shared key with Alice
4. Bob receives the public key and calculates the shared key (with Darth
instead of Alice)
5. Bob transmits his public key to Alice
6. Darth intercepts this and transmits his second public key to Alice. Darth
calculates a shared key with Bob
7. Alice receives the key and calculates the shared key (with Darth instead of
Bob)
 Darth can then intercept, decrypt, re-encrypt, forward all messages between
Alice & Bob
Pri
vat
e
ke
y

Pu
bli
c
ke
y

Sha
red
key
MAN-IN-THE-MIDDLE ATTACK

• Man-in-the-Middle Attack- person in between which intercepts


the communication between the sender and receiver.
• n and g are pubically known.
• Small letters x and y are private keys,not known to bob and
tom.
• Communication –via Tom not directly Alice & Bob
• Alice- Bob=Alice-Tom+Tom-Bob

You might also like