Constructions Of Cartesian Authentication Codes From Geometry Of Classical Groups Over Finite Field

In the present thesis, using subspaces of symplectic, unitary and orthogonal geometry , respectively ,we construct four classes of Cartesian authentication codes, and compute their size parameters. Moreover, assuming that the encoding rules are chosen according to a uniform probability distribution , we also compute the probabilities of a successful impersonation attack and of a successful substitution attack, respectively.