Answered step by step
Verified Expert Solution
Question
1 Approved Answer
In this problem, we demonstrate that for CMAC, a variant that XORs the second key after applying the final encryption doesn't work. Let us consider
In this problem, we demonstrate that for CMAC, a variant that XORs the second key after applying the final encryption doesn't work. Let us consider this for the case of the message being an integer multiple of the block size. Then, the variant can be expressed as VMAC(K, M) = CBC(K, M) Kl. Now suppose an adversary is able to ask for the MACs of three messages: the message 0-0o, where n is the cipher block size; the message 1-1"; and the message 10. As a result of these three queries, the adversary gets To CBC(K, 0) Ki; T,-CBC(K, 1) Ki and 7, CBC( K, [CBC( K, 1)]) Ki. Show that the adversary can compute the correct MAC for the (unqueried) message 0 ll (ToC) T). 12.4
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started