|
|
|
| A Construction of Cartesian Authentication Codes with Arbitrary Amounts of Sources and Authentication Symbols(Ⅱ) |
| Liu Jin-long; Xu Zong-ze |
| Department of Info. Sci. and Tech., Nanjing University of Aeronaut. And Astronaut., Nanjing 210016, China |
|
|
|
|
Abstract 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 sources 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.
|
|
Received: 09 November 2006
|
|
|
|
|
|
|
|
|
2008, Vol. 30 
