IACR paper details
Title  An improved collision probability for CBCMAC and PMAC 

Booktitle  IACR Eprint archive 

Pages  

Year  2007 

URL  http://eprint.iacr.org/2007/032 

Author  Avradip Mandal 

Author  Mridul Nandi 

Abstract 
In this paper we compute the collision probability of
CBCMAC for suitably chosen messages. We show
that the probability is $\Omega(\ell q^2/N)$ where $\ell$ is the
number of message block, $N$ is the size of the domain and $q$ is
the total number of queries. For random oracle the probability is
$O(q^2/N)$. This improved collision probability will help us to have
an efficient distinguishing attack and MACforgery attack. We also
show collision probability for PMAC with collision probability
$\Omega(q^2/N)$ (strictly more than birth day bound). We have used a
purely combinatorial approach to obtain this bound. The similar
analysis can be made for other MAC like XCBC,
TMAC, OMAC etc. We hope
this approach will help us to calculate related probabilities.


Search for the paper
@misc{eprint200713314,
title={An improved collision probability for CBCMAC and PMAC},
booktitle={IACR Eprint archive},
keywords={secretkey cryptography / Message Authentication Codes},
url={http://eprint.iacr.org/2007/032},
note={ mridul.nandi@gmail.com 13545 received 1 Feb 2007},
author={Avradip Mandal and Mridul Nandi},
year=2007
}
Download a complete BibTeX file.