首页 | 本学科首页   官方微博 | 高级检索  
     

笛卡尔积与认证码
引用本文:刘金龙,许宗泽.笛卡尔积与认证码[J].电子与信息学报,2008,30(6):1441-1444.
作者姓名:刘金龙  许宗泽
作者单位:南京航空航天大学信息科学与技术学院,南京,210016
摘    要:该文研究了笛卡尔积与认证码的关系,根据笛卡儿积的结构特点,提出了一种将认证符信息嵌入到编码规则的思想,从工程应用的角度实现了基于笛卡尔积的各阶欺骗概率相等的最优Cartesian认证码的构造,并给出了基于笛卡尔积和拉丁方的各阶欺骗概率相等的安全认证码的构造方案。以上两种构造方案均无需预先存储编码矩阵,既节约了大量的存储空间,又可以获得所需要的安全性。

关 键 词:笛卡尔积    最优认证码    拉丁方    安全认证码
收稿时间:2006-11-21
修稿时间:2007-5-8

Cartesian Product and Authentication Codes
Liu Jin-long,Xu Zong-ze.Cartesian Product and Authentication Codes[J].Journal of Electronics & Information Technology,2008,30(6):1441-1444.
Authors:Liu Jin-long  Xu Zong-ze
Affiliation:College of Info. Sci. and Tech., Nanjing Univ. of Aeronaut. and Astronaut, Nanjing 210016, China
Abstract:The relation between the Cartesian product and authentication codes is studied in this paper. A new idea to use the private keys to carry the information of the authentication symbols is presented, which is based on the character of Cartesian product’ structure. And the Cartesian product–based optimal authentication codes with equal cheating probabilities of all orders are constructed, which can be easily designed and can be applied well to engineering. In this paper, the secret authentication codes with equal cheating probabilities of all orders are also constructed which are founded on Cartesian product and Latin square. The two construction methods mentioned above need no pre-storing encoder matrix, so that a mass of storage is saved. At the same time, the two schemes can offer an enough security level expected.
Keywords:Cartesian product  Optimal authentication codes  Latin square  Secret authentication codes
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《电子与信息学报》浏览原始摘要信息
点击此处可从《电子与信息学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号