论文部分内容阅读
In this paper, we determine the normal forms of idempotent matrices for similarity over finite local rings Z/pkZ, from which we construct a Cartesian authentication code and compute its size parameters and the probabilities of successful impersonation and substitution attack under the hypothesis that the cecoding rules are chosen according to a uniform probability distribution.