A method to construct secret authentication codes by using Cartesian codes is presented in the paper. On the condition of not changing the quantity of encoding rules, the proposed method uses Latin square to reconstruct the optimum Cartesian authentication codes into perfect secret authentication codes.
Simmons G J. Authentication theory/coding theory.[J].Advances in Cryptology. In: Proc. Crypto84. Berlin: Springer-Verlag.1984,:-[2]Stinson D R. Construction for authentication/secrecy codes from certain combinatorial designs[J].Journal of Cryptology.1988, 1(2):119-127[3]Stinson D R. The combinatorics of authentication and secrecy codes[J].Journal of Cryptology.1990, 2(1):23-49[4]Jimbo M and Fuji-Hara R. Optimal authentication systems and combinatorial designs[J].IEEE Trans. on Info. Theory.1990, 36(1):54-62[5]王新梅, 马文平, 武传坤. 纠错密码理论. 北京: 人民邮电出版社, 2001: 246-258. Wang Xin-mei, Ma Wen-ping, and Wu Chuan-kun. Theory of Cryptology Based on Error-Correcting codes. Beijing: Posts Telecom Press, 2001: 246-258.[6]Gilbert E N, MacWilliams F J, and Stoane N J A. Codes which detect deception. The Bell System Technical., 1974, 53(3): 405-424.[7]马文平, 王新梅. 关于CARTESIAN认证码的构造. 电子学报, 1999, 27(5): 33-35. Ma Wen-ping and Wang Xin-mei. On the construction of CARTESIAN authentication codes. Acta Electronica Sinica, 1999, 27(5): 33-35.[8]邵嘉裕. 组合数学. 上海: 同济大学出版社, 1991: 39-49. Shao Jia-yu. Combinatorial Mathematics. Shanghai: Tongji University Press, 1991: 39-49.[9]杨德. 试验设计与分析. 北京: 中国农业出版社, 2002: 83-88. Yang De. Experimental Design and Analysis. Beijing: China Agriculture Press, 2002: 83-88.