利用有限域上的一类矩阵构作Cartesian认证码

Using One Class of Matrices over Finite Fields to Construct Cartesian Authentication Codes

利用有限域上的一类矩阵构作 Cartesian认证码 ,计算出了该类认证码的参数 ,并假定编码规则按等概率分布选取 ,计算出了该类认证码被成功地模仿攻击的最大概率 P1 及被成功地替换攻击的最大概率

In this paper, one construction of Cartesian authentication codes from one class of matrices over finite fields is presented and its size parameters are computed. Moreover, assuming that the encoding rules are chosen according to a uniform probability distribution, the P I and P S of these, which denote the largest probabilities of a successful impersonation attack and of a successful substitution attack are also computed.