Question: Problem: Consider the following protocol used by two parties A (Alice) and B (Bob) to send a message from A to B. 1. A to
Problem: Consider the following protocol used by two parties A (Alice) and B (Bob) to send a message from A to B.
1. A to B : M1 = M (XOR) NA where NA is As nonce (a randomly selected number)
2. B to A : M2 = M1 (XOR) NB where NB is Bs nonce
3. A to B : M3 = M2 (XOR) NA
a) Show that how B can recover M.
b) Is the system secure? Try whether someone with knowledge of M1, M2, and M3 can retrieve M. Defend your answer. (Note: The notation A to B means A sends to B) [Cryptographic Protocol from Applied Cryptography]
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
