Advanced Search
Volume 30 Issue 6
Dec.  2010
Turn off MathJax
Article Contents
Liu Jin-long, Xu Zong-ze . Cartesian Product and Authentication Codes[J]. Journal of Electronics & Information Technology, 2008, 30(6): 1441-1444. doi: 10.3724/SP.J.1146.2006.01840
Citation: Liu Jin-long, Xu Zong-ze . Cartesian Product and Authentication Codes[J]. Journal of Electronics & Information Technology, 2008, 30(6): 1441-1444. doi: 10.3724/SP.J.1146.2006.01840

Cartesian Product and Authentication Codes

doi: 10.3724/SP.J.1146.2006.01840
  • Received Date: 2006-11-21
  • Rev Recd Date: 2007-05-08
  • Publish Date: 2008-06-19
  • 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 productbased 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.
  • loading
  • Gilbert E N, MacWilliams F J, and Stoane N J A. Codeswhich detect deception. The Bell System Technical Journal,1974, 53(3): 405-424.[2]Simmons G J. Authentication theory/coding theory.[J].Advances in Cryptology. In: Proc. Crypto84. Berlin:Springer-Verlag.1984,:-[3]Wan Zhexian. Further constructions of Cartesianauthentication codes from symplectic geometry. NortheasterMathematical Journal, 1992, 8(1): 4-20.[4]Pei Dingyi. A problem of combinatorial designs related toauthentication codes[J].Journal of Combinatorial Designs.1998,6(6):417-4293.0.CO;2-I' target='_blank'>[5]Stinson D R. Combinatorial characterizations ofauthentication codes[J].Designs, Codes and Cryptography.1992,2(2):175-187[6]耿素云. 集合论与图论. 北京: 北京大学出版社, 1998: 30-34.Geng Su-yun. Set Theory and Graph Theory. Beijing: PekingUniversity Press, 1998: 30-34.[7]王新梅, 马文平, 武传坤. 纠错密码理论. 北京: 人民邮电出版社, 2001: 246-258.Wang Xin-mei, Ma Wen-ping, and Wu Chuan-kun. Theory ofCryptology Based on Error-Correcting Codes. Beijing: Posts Telecom Press, 2001: 246-258.[8]胡磊, 裴定一. 各阶欺骗概率相等的最优认证码. 应用数学学报, 2002, 25(1): 43-48.Hu Lei and Pei Ding-yi. Optimal authentication codes withequal cheationg probabilities of all orders. Acta MathematicaeApplicatae Sinica, 2002, 25(1): 43-48.[9]Pei Dingyi. A problem of combinatorial designs related toauthentication codes[J].Journal of Combinatorial Design.1998,6:417-4293.0.CO;2-I' target='_blank'>[10]邵嘉裕. 组合数学. 上海: 同济大学出版社, 1991: 39-49.Shao Jia-yu. Combinatorial Mathematics. Shanghai: TongjiUniversity Press, 1991: 39-49.
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (2955) PDF downloads(798) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return