Diffie Hellman

Key Exchange
Algorithm

Sai Sagar Jallu 19222004@nitdelhi.ac.in

Perquisites:

• Modular Arithmetic Terminologies

• Working of RSA Algorithm

Drawback of RSA:

• Computation
Message

N1 N2 N3 N4

For encryption each number has to undergo: cipher(C): N1P mod K

For De-encrypting: Cd mod K

Diffie Hellmann Key Exchange Algorithm:

• Exchange Secret/Symmetric Key

• Asymmetric Encryption, (Public key & Private Encryption)

Algorithm Working:

Step 1: Assume prime number q

Step 2: select Ɑ such that Ɑ is a primitive root of q & (Ɑ < q)

Step 3: Assume XA (Private key of user A) & (XA < q)

Calculate YA (Public key of user A); YA = ⱭXa mod q

Step 4: Assume XB (Private key of user B) & (XB < q)

Sender Receiver
Calculate YB (Public key of user B); YB = ⱭXa mod q
A B
Step 5: Key Generation ‘K’
K= (YB) Xa mod K= (YA) Xb mod
q q