利用非平凡幂等矩阵构作的Cartesian认证码

USING NON TRIVIAL IDEMPOTENT MATRICES OVER FINITE FIELDS TO CONSTRUCT CARTESIAN AUTHENTICATION CODES

本文利用有限域上的非平凡幂等矩阵构造了一个Ｃａｒｔｅｓｉａｎ认证码，并计算了其容量参数．进一步在编码规则按相同概率分布选择的条件下。

In this paper,a costruction of Cartesian authentication codes from non trivial idempotent matrices over a finite field is presented and its size parameters are computed.Moreover,assume that the encoding rules are chosen according to uniform probability ditribution,the P I and P s,which denote the largest probabilties of a successful impresonation attack and a successful substitution attack respectively,of these codes are also computed.