Pick a fellow classmate and use the Diffie-Hellman algorithm to agree on a secret key. Refer to yourselves as Alice and Bob. For ease of computation, Alice should choose small values for p and g, and publish them as a response to this topic. Alice and Bob should then each pick a secret number and calculate their individual T values, and publish them as new responses to this topic. Finally, Alice and Bob should calculate their shared key, and publish it as another response, showing the details of their calculations, including the secret keys used. If everything has gone according to plan, the shared keys that Alice and Bob publish should agree.[If you prefer to do this exercise individually, you can assume both roles yourself.]
