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

Using Symplectic Involutory Matrices over Finite Fields to Construct Cartesian Aythentication Codes

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

In this paper, one construction of Cartesian authentication codes from symplectic involutory matrices over finite fields are presented and its size parameters are computed. Moreover, assume that the encoding rules are chosen according to uniform probability distribution, the PI and Ps, which denote the largest probability of a successful impersonation attack and a successful substitution attack respectively, of these codes are alse computed.