A Construction of Cartesian Authentication Codes from Vector Space over Finite Field

In this paper, a construction of Cartesian authentication codes from vector space over finite fields is presented and its size parameters are computed. Under the assumption that the choose of encoding rules and source states obeys uniform probability distribution, the probabilities P
_I
of a successful impersonation attack and P
_S
of a successful substitution attack of these codes are also computed.