利用奇特征的正交几何构作认证码

A Construction of Authentication Codes from Orthogonal Geometry over Finite Fields of Characteristic Not 2

利用特征不为2的有限域上的正交几何构作出一类Cartesian认证码,并且计算了它们的参数.假定信源和编码规则都按等概率分布选取,求出了认证码的成功的模仿攻击概率PI和成功的替换攻击概率PS.作为一个推论,还得到了一些最优的Cartesian认证码.

In the present paper a construction of Cartesian authentication codes from orthogonal geometry over finite fields of characteristic not 2 are presented. The size parameters of the codes so constructed are computed. On assuming that both source states and encoding rules are chosen according to a uniform probability distribution, the probabilities P1 and Ps of a successful impersonation attack and a successful substitution attack of these codes are also computed respectively. As a corollary, some optimal Cartesian authentication codes are botained.