Securtiy Engineering question

Week 3 hand in assignments



Submit your assignment to the Assignment folder before midnight on Wednesday next week:
The RSA encryption and digital signature schemes details could be found at: http://www.
rsasecurity.com/rsalabs/node.asp?id=2214.

1. Suppose Fred sees your RSA signaure on m1 and m2 , (i.e., he sees (md mod n) and (md mod n).
1 2
How does he compute the signature on each of mj mod n (for positive integer j), m-1 mod n,
1 1
m1 × m2 mod n, and in general mj × mk mod n (for arbitrary j and k)?
1 2

2. List some of the attacks on the Diffie-Hellman key exchange protocol we discussed in the lecture.
Present your solution for avoiding such attacks.




1