IACR paper details
Title  Improved Security Analysis of PMAC 

Booktitle  IACR Eprint archive 

Pages  

Year  2007 

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

Author  Mridul Nandi 

Author  Avradip Mandal 

Abstract 
In this paper we provide a simple, concrete and improved security
analysis of {\bf PMAC}, a Parallelizable Message Authentication
Code. We show that the advantage of any distinguisher for {\bf PMAC}
based on a random permutation is at most $\mathbf{\frac{5q\sigma 
3.5 q^2}{2^n}}$, where $\sigma$ is the total number of message
blocks in all $q$ queries made by the distinguisher. In the original
paper by Black and Rogaway in Eurocrypt2002, the bound was
$\frac{(\sigma+1)^2}{2^{n1}}$. Very recently, Minematsu and
Matsushima in FSE2007, have provided a bound $\frac{10\ell
q^2}{2^n}$ where $\ell$ is the maximum block length of all messages
queried by the distinguisher. Our new bound is better than both
original and recently proposed bound and guarantees much more
security of PMAC. We also have provided a complete, independent and
simple combinatorial proof. This proof idea may help us to find a
similar result for other MAC algorithms.


Search for the paper
@misc{eprint200713313,
title={Improved Security Analysis of PMAC},
booktitle={IACR Eprint archive},
keywords={secretkey cryptography / Message Authentication Codes},
url={http://eprint.iacr.org/2007/031},
note={ mridul.nandi@gmail.com 13634 received 1 Feb 2007, last revised 1 May 2007},
author={Mridul Nandi and Avradip Mandal},
year=2007
}
Download a complete BibTeX file.