In this paper,one construction of Cartesian authentication codes from generalized symplectic involutory matrices over finite fields with char F≠2 is presented and its size parameters are computed.Moreover,assume that the encoding rules are chosen according to uniform probability distribution,the P_I and P_S,which denote the largest probabilities of a successful impersonation attack and a successful substitution attack respectively,of these codes are also computed.
|