摘要
为了充分发挥消息认证系统的安全性能,采用排列组合的方法首次构造了一类具有多重信源保密能力同时可以对抗多阶欺骗的认证码,并计算了该码的参数以及当信源和编码规则等概率选取时的各种攻击成功的概率。同时,本文也对认证码的密钥传输效率进行了分析,并在此基础上提出了一种密钥长度压缩算法。
A construction of authentication code with multi-fold secrecy and capacity to defend multi-fold deception is given and the parameters of the code are computed.Under the assumption that the information sources and the encoding rules are chosen according to a uniform probability distribution,the probabilities of all successful attacks are also computed.Moreover,in order to improve transmission efficiency of the authentication code,an effective key-length compression algorithm is proposed.
出处
《南京邮电大学学报(自然科学版)》
2011年第1期65-69,共5页
Journal of Nanjing University of Posts and Telecommunications:Natural Science Edition
基金
江苏省博士后科研资助计划(0902055C)资助项目
关键词
CARTESIAN认证码
保密认证码
排列组合
cartesian authentication codes
secret authentication codes
permutations and combinations