摘要
Two constructions of Cartesian authentication codes form involutory and idempotent matrices over finitefields are presented and their size Parameters are computed. Moreover, assume that the encoding rules are chosen ac-cording to a uniform Probablity distribution, the PI and Ps which dend the largest Probablities of a successful impersonation attack and a successful substitution attack respectively of these codes are also computed. Finially, it is Provedthat thase two Cartesian authentication codes are isomorphic.
Two constructions of Cartesian authentication codes form involutory and idempotent matrices over finitefields are presented and their size Parameters are computed. Moreover, assume that the encoding rules are chosen ac-cording to a uniform Probablity distribution, the PI and Ps which dend the largest Probablities of a successful impersonation attack and a successful substitution attack respectively of these codes are also computed. Finially, it is Provedthat thase two Cartesian authentication codes are isomorphic.
