A CONSTRUCTION OF CARTESIAN AUTHENTICATION CODE FROM ORTHOGONAL SPACES OVER A FINITE FIELD OF ODD CHARACTERISTIC

Abstract

In this paper, we construct a Cartesian authentication code from subspaces of orthogonal space [Formula: see text] of odd characteristic 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.