The Construction of Symplectic Involutions Over Finite Field with CharF=2 and Its Applications  

作　　者：ZHAO Jing YUAN Jian-xin NAN Ji-zhu 

机构地区：[1]Department of Applied Mathematics, Dalian University of Technology, Dalian 116024, China [2]College of Machanical and Electronic, Kaifeng University, Kaifeng 475004, China

出　　处：《Chinese Quarterly Journal of Mathematics》2009年第2期173-184,共12页数学季刊（英文版）

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

摘　　要：In the present paper, we compute the number of the symplectic involaLions over the finite field F with chafF = 2, and also one Cartesian authentication code is obtained.Furthermore, its size parameters are computed completely. If assume that the coding rules are chosen according to a uniform probability, PI and Ps denote the largest probabilities of a successful impersonation attack and a successful substitution attack respectively, then PI and Ps are also computed.

关 键 词：authentication code symplectic involution finite field 

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