CONSTRUCTION OF CARTESIAN AUTHENTICATION CODES OVER SYMPLECTIC SPACES
A construction of Cartesian authentication codes over symplectic spaces is presented and its size parameters are computed. Assuming the encoding rules are chosen according to a uniform probability distribution, the probabilities of success for different types of attacks are also computed.
Cartesian authentication code, symplectic geometry, finite field.
