摘要
认证码被用在通讯渠道中,除了发方和收方外,还存在一个敌方,敌方掌握某种手段,可以模仿攻击或替换攻击.本文利用有限域上Herm ite矩阵的标准型构作了一个卡式认证码并计算出该码的所有参数,进而,假定编码规则按照统一的概率分布所选取,该码的成功伪造与成功替换的最大概率P1与PS亦被计算出来.
Authentication codes are used in communication channels where besides the transmitter and the receiver there is an opponent who may play either the impersonation attack or the substitution attack in this paper. One construction of Cartesian authentication codes from the normal form of Hermite matrices over finite fields are presented and its size parameters are computed. Moreover, assume that the encoding rules are chosen according to a uniform probability distribution. The largest probabilities of a successful impersonation attack and of a successful substitution attack are also computed.
出处
《安徽大学学报（自然科学版）》
CAS
北大核心
2006年第5期17-19,共3页
Journal of Anhui University(Natural Science Edition)
