Question: Alice want to send a single bit of information (a yes or a no) to Bob by means of a word of length
2. Alice and Bob have four possible keys available to perform message authentication. The following matrix shows the 2-bit word sent for each message under each key: ` Message Key 0 1 1 00 01 2 10 00 3 01 11 4 11 10
a. The preceding matrix is in a useful form for Alice. Construct a matrix with the same information that would be more useful for Bob.
b. What is the probability that someone else can successfully impersonate Alice?
c. What is the probability that someone can replace an intercepted message with another message successfully?