Using Permutation Groups To Construct Cartesian Authentication Codes

In this paper, one construction of Cartesian authentication codes from some special subsets of permutation group is presented and its size parameters are computed. Moreover, assuming that the encoding rules are chosen according to a uniform probability distribution, the P_I and P_S, which denote the largest probabilities of a successful impersonation attack and of a successful substitution attack respectively, of these codes are also computed.