摘要
利用有限域上辛几何、酉几何及正交几何的几种类型的于空间构作了若干个Cartesian认证码,计算了它们的参数。假设编码规则按照一种均匀概率分布选择,那么假冒攻击成功的概率P_r和替换攻击成功的概率P_S也被计算。
A class of Cartesian authentication codes is constructed from the geometry of classical groups over finite fields and their size parameters are computed. Assume that the encoding ruler are chosen according to a uniform probability distribution, the probabilities PI and P5 of a successful impersonation attack and a successful substitution attack, respectively, of these codes are also computed.
出处
《张家口师专学报》
2000年第1期65-75,共11页
Journal of Zhangjiakou Teachers College
基金
National Narural Science Foundation of China(19571024)and Hebei Education Committee
关键词
辛几何
酉几何
正交几何
认证码
有限域
Symplectic Geometry
Unitary Geometry: Orthogonal Geometry
Authentication Code
Finite Field.
