利用结合方案构作完全保密的认证码  

A Construction of Authentication codes with perfect Secrecy from Association Schemes

作　　者：赵友蕙[1] 

机构地区：[1]北京信息职业技术学院基础部,北京100031

出　　处：《首都师范大学学报（自然科学版）》2007年第4期8-11,共4页Journal of Capital Normal University：Natural Science Edition

摘　　要：利用结合方案构作出一类完全保密的认证码,计算了认证码的参数,并假定按照等概率分布选择编码规则,计算了成功模仿攻击概率和成功替换攻击概率.进一步地,在由一种典型群上的几何构作的结合方案上具体得到一类完全保密的认证码.　In the present paper a construction of authentication codes with perfect secrecy from association schemes are presented.The size parameters of the codes so constructed are computed.On assuming that encoding rules are chosen according to a uniform probability distribution,the probabilities of a successful impersonation attack and a successful substitution attack of these codes are also computed respectively.Morecover,some authentication codes with perfect secrecy from association schemes,which are constructed from Geometry of Classical Groups,are given.

关 键 词：认证码 结合方案 典型群. 

分 类 号：O157.4[理学—数学]