Construction of Cartesian Authentication Codes from 2-Jordan Normal Form of Matrices
Jizhou Luo · Gongcheng shuxue xuebao · 2006
A new construction of Cartesian authentication codes from the 2-Jordan normal form of matrices over finite fields is presented, and its size parameters are computed. Moreover, by assumeing that the encoding rules are chosen according to a uniform probability distribution, the largest probabilities of a successful impersonation attack and of a successful substitution attack are also computed, respectively.