Using Pseudo—Cnvolutory Matrices over Finite Fields to Construct Cartesian Authentication Codes
Han Zhen-fang · 2005
In this paper, one construction of Cartesian authentication codes from pseudo-involutory matrices over finite field was presented and its size parameters was computed. Assuming that the encoding rules was chosen according to uniform probability distribution, the P_I and P_S which denoted the largest probalities of a successful impersonation attack and a successful substitution attack respectively, of these codes was also computed.