1- Alice and Bob use Diffie-Hellman with prime p = 97, primitive root g = 10 to establish a common secret. Alice generates random a = 13, and Bob generates random b = 43. Alice sends to Bob gamod p, and Bob sends to Alice gbmod p. What will be the common secret value s shared by Bob and Alice. Show work.

2- Alice uses the secret s established in problem 1 to transmit the message "Welcome to LIU" to Bob in such a way that Bob will be sure the message comes from Alice and has not been tampered with. For this Alice appends the secret to the end of the message and computes the MD5 hash. What will Alice end up sending to Bob?

(To compute the hash of a string, say "The quick fox" you can doecho -n The quick fox | md5sum )