| Abstract: | In the present paper a construction of Cartesian authentication codes from the
geometry of classical groups over finite fields is presented. On assuming that encoding rules
are chosen according to a uniform probability distribution, the probabilities P I and P S of
a successful impersonation attack and a successful substitution attack, respectively, of these
codes are also computed. Moreover, those codes so constructed, for which P I and (or) P S
are optimal, are determined, and then some transversal designs are also obtained. |
