利用有限局部环Z/p^kZ上的矩阵构作Cartesian认证码

Using matrices over Z/p^kZ to construct cartesian authentication codes

设R=Z/pkZ,其中p是素数,k>1.利用R上矩阵的标准型构作了一个Cartesian认证码,并计算了该认证码的各个参数.在假定信源和编码规则按照等概率均匀分布的条件下,给出了认证码的成功模仿攻击概率PI和替换攻击概率PS.

Let R=Z/pkZ be a finite local ring where p is a prime and k>1.In this paper,we used matrices over the finite local ring R to construct Cartesian authentication codes.Moreover,assume that the encoding rules were chosen according to a uniform probability,PI and PS,which denote the largest probabilities of a successful impersonation attack and a successful substitution attack,respectively that were also computed.