Problem 1: We use a Message Authentication Code (MAC) to verify the integrity and authenticity of the message. What are the benefits of creating a single message authentication code (MAC) for a large file over multiple MACs (e.g. MAC per a block)?
Problem 2: Explain how Diffie-Hellman key exchange protocol can share a secret value without divulging it to any other person and show an example.
Problem 3: For the given p=23, q=37, calculate the public key and the private key of RSA and verify your solution is correct.
Problem 4: Let p=79, q=89, n=pq, and e=3. Is (n, e) a valid RSA public key? If so, compute the corresponding private RSA key d. If not, why not?