121
click to vote
FSE
2003
Springer
15 years 10 months ago
2003
Springer
In this paper, we present One-key CBC MAC (OMAC) and prove its security for arbitrary length messages. OMAC takes only one key, K (k bits) of a block cipher E. Previously, XCBC req...
113
click to vote
CRYPTO
2005
Springer
15 years 10 months ago
2005
Springer
We present an improved bound on the advantage of any q-query adversary at distinguishing between the CBC MAC over a random n-bit permutation and a random function outputting n bit...