构造一类cartesian认证码的新方法  

New construction of cartesian authentication codes

作　　者：赵永鹏[1] 周厚春[2] 

机构地区：[1]山东师范大学数学科学学院,济南250014 [2]临沂大学理学院,山东临沂276005

出　　处：《计算机工程与应用》2013年第18期86-88,共3页Computer Engineering and Applications

基　　金：国家自然科学基金(No.10771120);山东省自然科学基金(No.Y2008A27)

摘　　要：利用完全图K n中的k-生成树性质构造了一个新的cartesian认证码,计算了码参数,当编码规则按照均匀的概率分布被选取时,计算了该码的成功冒充攻击概率、成功替换攻击概率和r阶欺骗攻击成功的概率,改进了已有的相关结果。The cartesian authentication codes based on k-spanning tree are constructed and their parameters are derived.The probabilities of success for the impersonation attack,the substitution attack and r-spoofing attack are also computed respectively based on the assumption of the encoding rules which are chosen according to a uniform probability distribution.These results extend results given by Wang Yongchuan and Yang Yixian.

关 键 词：CARTESIAN认证码 k-生成树 r阶欺骗攻击 信息论下界 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]