Question: Let M denote computing a CBC-MAC under some cipher. Suppose x and y are two string of bits that are multiples of the block length

Let M denote computing a CBC-MAC under some cipher. Suppose x and y are two string of bits that are multiples of the block length of the cipher such that M(x) = M(y). Show how to create two other messages x’ and y’ such that M(x’) = M(y’). How many such pairs can be made?

Step by Step Solution

3.37 Rating (147 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

CBCMAC for message authentication For our purposes lets only consider CBCMAC with the AES block cipher and assume that CBCMAC only takes inputs that are a multiple of 128 bits long But we do allow CBC... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Computer Network Questions!