Description: Implement Diffie-Hellman Key exchange protocol and demonstrate that at the
end, both person will have a common Key.
Do the following:
1. Set a variable p ( e.g. p = 37) and g (e.g. g = 5).
2. Generate a, a random number mod p. Now generate A, which is g raised to
the a power mod p i.e. A = (ga) mod p .
3. Do the step 2 for b and B.
4. A and B are public keys. Generate a session key with them set s1 to B raised
to the a power mod p so s1 = (Ba) mod p.
5. Do the step 4 with A and b i.e. (Ab) mod p = s2.
6. check the correctness i.e. check whether you came up with the s1 == s2.
(b) Write a program to demonstrate the man in the middle attack is possible using
an example. You can perform set up as described in the above problem.
To Search:
File list (Check if you may need any files):
diffie_hellman.cpp