Informational Divergence Bounds for Authentication Codes

We give an easy derivation of Simmons’ lower bound for impersonation games which is based on the non-negativity of the informational divergence. We show that substitution games can be reduced to ancillary impersonation games. We use this fact to extend Simmons’ bound to substitution games: the lower bound we obtain performs quite well against those available in the literature.