A Simple Construction of Cartesian Authentication Codes
Zhai Hong-chun · 2004
In the paper, a construction of Cartesian authentication codes from special matrices over finite fields is presented and its size parameters are computed. Besides, assuming that the encoding rules are chosen based on a uniform probability distribution, the PI and PS which denote the largest probabilities of a successful impersonation attack and of a successful substitution attack of these codes,respectively, are also computed.