Show steps of the Diffie Hellman Key Exchange algorithm with one solved example.

Write the java program for the Diffie Hellman Key Exchange that accepts the value for P and G from the user.

But, randomly generate the private key values for Alice and Bob and calculate Secret Key SA and SB from both sides.

Also, show randomly generated values for private keys (PA, PB), calculated values for public keys (pa, pb), and finally secret keys (SA, SB)

Test the program for following Three examples:

a] P = 7, G = 17

b] P = 17, G = 5

c] P = 5, G = 3

Diffie Hellman Key Exchange Algorithm

Step 1 -

• Both parties say Alice and Bob initially agreed on the two values 'P' and 'G'.
• Where P is a prime number and G is the generator or primitive root of a prime number.
• In that value of P must be greater than …