Johnson图相关联的一类新的认证码  

One familie new authentication codes associated with Johnson graph

作　　者：岳孟田[1] 李增提[2] 

机构地区：[1]廊坊师范学院科研处,河北廊坊065000 [2]廊坊师范学院数信学院,河北廊坊065000

出　　处：《河北大学学报（自然科学版）》2012年第5期464-466,共3页Journal of Hebei University(Natural Science Edition)

基　　金：国家自然科学基金资助项目(10971052)

摘　　要：利用Johnson图J(dm,d)得到了新的认证码,并进一步得到了这类码的参数.在假定编码规则按等概率分布选取时,计算出这类码的模仿攻击成功和替换攻击成功的概率.Construct one familie new authentication code from a Johnson graph.Moreover we computed its parameters.Assuming that the encoding rules are chosen according to a uniform probability distribution,the probability of successful impersonation attack and substitution attack are also computed.

关 键 词：Johnson图 认证码 团 

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