Paper 2010/014

A Unified Method for Improving PRF Bounds for a Class of Blockcipher based MACs

Mridul Nandi

Abstract

This paper provides a unified framework for {\em improving} \PRF(pseudorandom function) advantages of several popular MACs (message authentication codes) based on a blockcipher modeled as \tx{RP} (random permutation). In many known MACs, the inputs of the underlying blockcipher are defined to be some deterministic affine functions of previously computed outputs of the blockcipher. Keeping the similarity in mind, we introduce a class of \tx{ADE}s (affine domain extensions) and a wide subclass of \tx{SADE}s (secure \tx{ADE}) containing $\mathcal{C}=\{\text{tx}CBC-MAC,\text{tx}{GCBC}^{\ast },\text{tx}OMAC,\text{tx}PMAC\}$. We define a parameter $N(t,q)$ for each domain extension and show that all \tx{SADE}s have \PRF advantages $O(tq/2^n+N(t,q)/2^n)$ where $t$ is the total number of blockcipher computations needed for all $q$ queries. We prove that \PRF advantage of any \tx{SADE} is $$ by showing that $$ is always at most $$. We provide a better estimate $$ of $$ for all members of $$ and hence these MACs have {\em improved advantages $$}. Our proposed bounds for \tx{CBC-MAC} and $$ are better than previous best known bounds.