距离正则图相关联的两类认证码  

Two kinds of authentication codes associated with distance-regular graphs

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

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

出　　处：《河北科技大学学报》2012年第1期11-13,共3页Journal of Hebei University of Science and Technology

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

摘　　要：利用了序为(s,t)的距离正则图和直径为d的对极的距离正则图构造了2类Cartesian认证码,并且计算了它们的参数及模仿攻击成功的概率PI和替换攻击成功的概率PS。Two kinds of Cartesian codes are constructed by using a distance-regular graph of order(s,t) and antipodal distance-regular graphs of diameter d,respectively.Moreover,their parameters and the probability of successful impersonation attack and substitution attack are computed,respectively.

关 键 词：距离正则图 认证码 团 

分 类 号：O15[理学—数学]