Using Hermite Matrices over Finite Field to Construct Cartesian Authentication Code
Li Li · 2002
In this paper,a Cartesian authentication code constructed with Henmite matrices over finite field is presented and its size parameters are computed.Moreover,assuming that the encoding rules are chosen according to uniform probability distribution,the P I and P S which denote the largest probalities of successful imitative affack and successful substitutive attack respectively,of this code are also computed.