利用伪对合矩阵构造Cartesian认证码

Using Pseudo—Cnvolutory Matrices over Finite Fields to Construct Cartesian Authentication Codes

利用伪对合矩阵构作了一个Cartesian认证码,并且计算了其参数。假设编码规则是按均匀概率分布选取时,计算了模仿攻击成功的概率P_I和替换攻击成功的概率P_S。

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 PI and Ps, which denoted the largest probalities of a successful impersonation attack and a successful substitution attack respectively, of these codes was also computed.