Construction of Cartesian Authentication Codes from Pseudo Symplectic Geometry of Even Dimension

In the present paper, two constructions of Cartesian authentication codes from pseudo symplectic geometry of even dimension over finite fields of characteristic 2 are presented and their size parameters are computed. Moreover, under the assumption that the encoding rules are chosen according to a uniform probability distribution, the largest probability of a successful impersonation attack and of a successful substitution attack of those codes are also computed.