Using Idempotent Matrices Over Local Ring To Construct Authentication Codes With Arbitration

In this paper, we construct an authentication code with arbitration from the nor-mal form of idempotent matrices for similarity over the finite local ring Z/pmZ, and four associated parameters of the codes are calculated. In addition, we give five maximum probabilities of each successful attack under the hypothesis that the encoding rules and decoding rules are chosen according to a uniform probabilities distribution.