Several classes of authentication codes with the lowest probabilities of successful impersonation and substitution attack and the smallest encoding rules are constructed

and also authentication code with the lowest probabilities of successfully impersonation and substitution attack and the smallest encoding rules and the largest source states is constructed by elementary methods.A new modified method of restructuring Cartesian authentication codes into perfect secret authentication code is given and the quantity of encoding rules of the modified scheme is the same as original scheme.