Using Normal Form of Matrices over Finite Fields to Construct Cartesian Authentication Codes

Abstract:

      In this paper, one construction of Cartesian authentication codes from the normal form of matrices over finite fields are presented and its size parameters are computed. Moreover, assume 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.