Let M denote computing a CBC-MAC under some cipher. Suppose x and y are two string of
Fantastic news! We've Found the answer you've been seeking!
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 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?
Related Book For
Probability and Statistics
ISBN: 978-0321500465
4th edition
Authors: Morris H. DeGroot, Mark J. Schervish
Posted Date: