摘要
利用有限域上的辛几何构作了一个Cartesian认证码,并计算了这个码的参数。进而,假定编码规则按照均匀的概率分布所选取,计算出了该码被模仿攻击成功的最大概率P1和被替换攻击成功的最大概率P3。
A consturction of Cartesian authentication codes from symplectic is presented. The parameters of the code are computed. Moreover, assumed that the encoding rulesare chosen according to a uniform probability destribution, the P1 and Ps which denotes the largest probabilities of a successful impersonation attack and,of a successful substitution attack respectively ,and these codes are also computed.
出处
《河北理工大学学报（自然科学版）》
CAS
2008年第1期49-53,共5页
Journal of Hebei Polytechnic University:Social Science Edition
