On a Fallacious Bound for Authentication Codes

Abstract. We show that the lower bound on substitution success probability PS provided by Theorem 3.8 in De Soete's paper [4], which appeared earlier in this journal, is not correct by exhibiting a counterexample. We identify the flaw in the ``proof" of this theorem and we prove a valid lower bound on PS .