Scribd
Upload
48 views8 pages

Lecture 9-B Diffie and Hellman Key Exchange Algorithm: By: Dr. Syed Irfan Ullah Abasyn University Peshawar

This document summarizes the Diffie-Hellman key exchange algorithm proposed in 1976. It allows two parties to exchange a secret key over an insecure channel. The algorithm uses public key cryptography where each party generates a public/private key pair. A shared secret key is computed from the two public keys which both parties can calculate but an eavesdropper cannot determine easily. The security relies on the difficulty of solving discrete logarithms. An example is provided to illustrate how Alice and Bob can generate a secret key to use for encrypting future communications.

Uploaded by

nazer
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
48 views8 pages

Lecture 9-B Diffie and Hellman Key Exchange Algorithm: By: Dr. Syed Irfan Ullah Abasyn University Peshawar

This document summarizes the Diffie-Hellman key exchange algorithm proposed in 1976. It allows two parties to exchange a secret key over an insecure channel. The algorithm uses public key cryptography where each party generates a public/private key pair. A shared secret key is computed from the two public keys which both parties can calculate but an eavesdropper cannot determine easily. The security relies on the difficulty of solving discrete logarithms. An example is provided to illustrate how Alice and Bob can generate a secret key to use for encrypting future communications.

Uploaded by

nazer
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/ 8

Lecture 9-B

Diffie and Hellman Key


Exchange Algorithm
By:
Dr. Syed Irfan Ullah
Abasyn University Peshawar
Diffie-Hellman Key Exchange
• first public-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
• Self

• https://www.youtube.com/watch?v=ESPT_36pUFc
Diffie-Hellman Key Exchange
• a public-key distribution scheme
• cannot be used to exchange an arbitrary message
• rather it can establish a common key
• known only to the two participants
• value of key depends on the participants (and their private and public
key information)
• based on exponentiation in a finite (Galois) field (modulo a prime or a
polynomial) - easy
• security relies on the difficulty of computing discrete logarithms
(similar to factoring) – hard
Diffie-Hellman Setup
• all users agree on global parameters:
• large prime integer or polynomial q
• a being a primitive root mod q
• each user (e.g A) generates their key
• chooses a secret key (number): xA < q
• compute their public key: yA = axA mod q
• each user makes public that key yA
Diffie-Hellman Key Exchange
• shared session key for users A & B is KAB:
xA.xB
KAB = a mod q
xB
= yA mod q (which B can compute)
xA
= yB mod q (which A can compute)
• KAB is used as session key in private-key encryption scheme between
Alice and Bob
• if Alice and Bob subsequently communicate, they will have the same
key as before, unless they choose new public-keys
• attacker needs an x, must solve discrete log
Diffie-Hellman Example
• users Alice & Bob who wish to swap keys:
• agree on prime q=353 and a=3
• select random secret keys:
• A chooses xA=97, B chooses xB=233
• compute respective public keys:
• yA=397 mod 353 = 40 (Alice)
• yB=3233 mod 353 = 248 (Bob)
• compute shared session key as:
• KAB= yBxA mod 353 = 24897 mod 353= 160 (Alice)
• KAB= yAxB mod 353 = 40233 mod 353= 160(Bob)
The End

You might also like