Diffie-Hellman Algorithm
(cont.)
¨There exists Xa such that Xa = ga mod p where g is the generator,
p
is a large prime number, and a is a private secret
known only to the initiator
¨There exists Xb such that Xb = gb mod p where g is the generator,
p
is a large prime number, and b is a private
secret known only to the responder
¨Initiator and responder can generate a shared secret known only to the two of them by exchanging the values Xa and Xb with each
other
¨Initiator secret = (Xb)a mod p
= (Xa)b mod p
= responder secret = gab