c. Suppose Alice computes the Secret suffix MAC (page 322: secret suffix MAC(x) = h(x || key)) for the message ”AM” with key “G” that both Alice and Bob know. The hash function that is used is h(x1x2x3)= g(g(x1 XOR x2) XOR x3 ) where each xi is a character represented as 8 bits, and g(x) is a 8-bit string that is equal to the complement of bits in x. For example, g(10110011) = 01001100. The MAC is 8 bits. (8-bit ASCII representation of the characters is given below.) What is the Secret suffix MAC computed by Alice? Show the MAC as the single character. What information is sent by Alice to Bob.
**Please do C**
**C IS different from B**
a.
Compute CBC-MAC for a message of 16 bits, “8642” (in Hexa). Assume a block size of 8 bits with an IV=F1 (in hexa). For simplicity, assume the encryption to be a simple XOR of the key with the plaintext. Let the encryption key be B4 (in Hexa).
- What is the Secret prefix MAC computed by Alice? Show the MAC as the single character.
- What information is sent by Alice to Bob?
c.
Suppose Alice computes the Secret suffix MAC (page 322: secret suffix MAC(x) = h(x || key)) for the message ”AM” with key “G” that both Alice and Bob know. The hash function that is used is h(x1x2x3)= g(g(x1
XOR x2) XOR x3 ) where each xi is a character represented as 8 bits, and g(x) is a 8-bit string that is equal to the complement of bits in x. For example, g(10110011) = 01001100. The MAC is 8 bits. (8-bit ASCII representation of the characters is given below.)
-
- What is the Secret suffix MAC computed by Alice? Show the MAC as the single character.
- What information is sent by Alice to Bob.
Step by step
Solved in 2 steps with 2 images