Using Some Matrix Over Finite Local Ring To Construct Authentication Codes With Arbitration

In this paper, we construct an authentication code with arbitration from Smith nor-mal forms of a special class of matrices over the finite local ring Z/pkZ, and the associated parameters of the codes are computed. In addition, under the assumption that the encod-ing rules of the transmitter and the receiver are chosen according to a uniform probabilities distribution, we calculate the maximum probabilities of each successful attack.