利用SLn(Fq)的BN对分解构造Cartesian认证码

In the present paper,a construction of Cartesian authentication codes by using the BN pair decomposition of special linear group is presented.Moreover,under the case that the encoding rules are chosen according to a uniform probability distribution,the probability of a successful impersonation attack and the probability of a successful substitution attack of the code are computed.