J4

• Original Articles • Previous Articles    

Construction of two sorts of cartesian authentication codes

LIU Jin-long;XU Zong-ze
  

  1. (Dept. of Info. Sci. and Tech., Nanjing Univ. of Aeronaut. and Astronaut, Nanjing 210016, China)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-06-20 Published:2007-06-20

Abstract: A method to construct one sort of optimal Cartesian authentication codes by using the cyclic array is presented. The method is easy to realize and it needs no complicated calculation over group or finite fields. Another iterative means to construct one class of Cartesian authentication codes with the k sources and 1/n probabilities of successful impersonation and substitution attack is also proposed, where parameters k and n are two arbitrary positive integers. Compared with the Cartesian authentication codes constructed by Descartes product, the authentication codes produced by iterative means have far fewer encoding rules, when they contain the same parameters k and n.

Key words: Cartesian authentication codes, the optimal Cartesian authentication codes, orthogonal arrays

CLC Number: 

  • TN918