利用有限域上典型群几何学构造Cartesian认证码(英文)  

Constrctions of Cartesian Authentcation Codes from Geometry of Classical Groups over Finite Fields

作　　者：李凤高[1] 霍元极[1] 

机构地区：[1]张家口师范专科学校数学系,张家口075028

出　　处：《张家口师专学报（自然科学版）》1997年第2期1-19,共19页

基　　金：Supported by the National Natural Science Foundation of China

摘　　要：利用偶特征的有限域上正交几何构造了一类Cartesian认证码,详细地计算了其参数。对于有限域上典型群的其它几何(辛几何、酉几何及奇特征的正交几何),也构造了相应的Cartesian认证码,给出了它们的参数。假设编码规则按照一种均匀分布选择,则这些码的成功攻击概率P_I和替换攻击成功概率P_S也被计算。In this paper a construction of Cartesian authentication codes is given from geometry of classical groups over finite fields, and their size parameters are computed. Assume that the encoding rules are chosen according to a uniform probability distribution, the probabilities PI and PS of a successful impersonation attack and a successful substitution attack, respectively, of these codes are also computed.

关 键 词：典型群 几何学 CARTESIAN认证码 有限域 辛几何 酉几何 正交几何 编码规则 

分 类 号：O157.4[理学—数学] O187.2[理学—基础数学]