摘要
利用了序为(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.
出处
《河北科技大学学报》
CAS
2012年第1期11-13,共3页
Journal of Hebei University of Science and Technology
基金
国家自然科学基金资助项目(10971052)
关键词
距离正则图
认证码
团
distance-regular graph
authentication code
clique
