| Johnson图相关联的一类新的认证码 |
| |
| 引用本文： | 岳孟田,李增提.Johnson图相关联的一类新的认证码[J].河北大学学报(自然科学版),2012,32(5):464-466. |
| |
| 作者姓名： | 岳孟田 李增提 |
| |
| 作者单位： | 1. 廊坊师范学院科研处,河北廊坊06500
2. 廊坊师范学院数信学院,河北廊坊,065000 |
| |
| 基金项目： | 国家自然科学基金资助项目(10971052) |
| |
| 摘 要： | 利用Johnson图J(dm,d)得到了新的认证码,并进一步得到了这类码的参数.在假定编码规则按等概率分布选取时,计算出这类码的模仿攻击成功和替换攻击成功的概率.
|
| 关 键 词： | Johnson图 认证码 团 |
One familie new authentication codes associated with Johnson graph |
| |
| YUE Mengtian
,
LI Zengti.One familie new authentication codes associated with Johnson graph[J].Journal of Hebei University (Natural Science Edition),2012,32(5):464-466. |
| |
| Authors: | YUE Mengtian LI Zengti |
| |
| Institution: | 1.Department of Scientific Research,Langfang Normal College,Langfang 065000,China; 2.Mathematics and Information College,Langfang Normal College,Langfang 065000,China) |
| |
| Abstract: | 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. |
| |
| Keywords: | distance-regular graph authentication code clique |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
