Say  = (Gen, Mac, Vrfy) is a secure MAC, and for k ∈ {0, 1} n the tag-generation algorithm Mack always outputs tags of length t(n). Prove that t must be super-logarithmic or, equivalently, that if t(n) = O(log n) then  cannot be a secure MAC.

 

 

Doing a similar assignment? Save your time and hire our Genuine Essay Writers to do your task. Get 15% Discount on your 1st order. Use code: FREE15