Abstract.
We show that the lower bound on substitution success probability P S 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 P S .
Article PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received 13 March 1996 and revised 21 May 1997
Rights and permissions
About this article
Cite this article
Blundo, C., De Santis, A., Kurosawa, K. et al. On a Fallacious Bound for Authentication Codes . J. Cryptology 12, 155–159 (1999). https://doi.org/10.1007/s001459900049
Published:
Issue date:
DOI: https://doi.org/10.1007/s001459900049