(HW1) List some of the attacks on the Diffie-Hellman key exchange protocol we discussed in the lecture. Present your solution for avoiding such attacks.
(HW2a) In the Diffie-Helman protocol, g=11, p=29, x=5, and y=7.
What is the value of the symmetric key?
What is the value of R1 and R2?
Variations of data
g=7, p=23, x=3, and y=5
g=5, p=19, x=7, and y=3
g=11, p=31, x=3, and y=9
g=7, p=43, x=2, and y=7
(HW2b) In the Diffie-Helman protocol, what happens is x and y have the same value, that is, Alice and Bob accidentally chosen the same number? Are R1 and R2 same? Do the session key calculated by Alice and Bob have the same value? Explain what would adversary observe? Could she guess Alice’s and Bob’s private key? Use an example to prove your claims.
(HW3a) Using RSA scheme, let p=23, q=31, d=457, calculate the public key e. Provide detailed description of all steps, explain what information will be published and what destroyed.
Optionally: Encrypt and decrypt simple message M1=100.
Variation of data
p=23, q=31, d=233
p=23, q=31, d=139
(HW3b) Suppose Fred sees your RSA signature on m1 and m2, (i.e., he sees (m1d mod n) and (m2d mod n)). How does he compute the signature on each of m1j mod n (for positive integer j), m1-1 mod n, m1 x m2 mod n, and in general m1j m2k mod n (for arbitrary j and k)?
