任意信源数和认证符数的Cartesian认证码的构造(Ⅱ)  

A Construction of Cartesian Authentication Codes with Arbitrary Amounts of Sources and Authentication Symbols(Ⅱ)

作　　者：刘金龙[1] 许宗泽[1] 

机构地区：[1]南京航空航天大学信息科学与技术学院,南京210016

出　　处：《电子与信息学报》2008年第5期1210-1213,共4页Journal of Electronics & Information Technology

摘　　要：对于任意两个相互无关的参数k,n,该文提出了一种基于正交排列的迭代方法,并以该方法为主构造了一类信源数目为k,认证符数目为n的Cartesian认证码。在信源和编码规则分布等概的条件下,敌方模仿攻击和替换攻击成功的概率均为1/n。在相同的k,n条件下,与已知的笛卡儿积构造法相比,迭代法所构造的Cartesian认证码的编码规则数目更少。An iterative method based on orthogonal arrays is presented in this paper. And this method is used as the primary means to construct Cartesian authentication codes with k soarces and n authentication symbols, where k and n are two arbitrary positive integers. When each source occurs equally often and encoding rule distribution is uniform, the probabilities of successful impersonation and substitution attack are 1/n. Compared with the Cartesian authentication codes constructed by Descartes product, the authentication codes produced with iterative means have much less encoding rules, when they contain the same parameters k and n.

关 键 词：CARTESIAN认证码 认证符 正交排列 

分 类 号：TN918[电子电信—通信与信息系统]