A CONSTRUCTION OF CARTESIAN AUTHENTICATION CODE FROM SINGULAR SYMPLECTIC SPACES OVER A FINITE FIELD
Shufang Zhao, Zengti Li · Discrete Mathematics Algorithms and Applications · 2014
In this paper, we construct a Cartesian authentication code from subspaces of singular symplectic space [Formula: see text] and compute its parameters. Assuming that the encoding rules of the transmitter and the receiver are chosen according to a uniform probability distribution, the probabilities of successful impersonation attack and substitution attack are also computed.