利用有限域上的2级准对角矩阵构作Cartesian认证码  

Using 2 by 2 Quasi-diagonal Matrix over Finite Fields to Construct Cartesian Authentication Codes

作　　者：李殿龙[1] 隋思涟[1] 等 

机构地区：[1]青岛建筑工程学院数理信息系，青岛266033

出　　处：《青岛建筑工程学院学报》2001年第4期61-66,共6页Journal of Qingdao Institute of Architecture and Engineering

摘　　要：利用有限域上的 2级准对角矩阵构作 Cartesian认证码 ,计算出了该类认证码的参数 .在假定编码规则按等概率分布选取的条件下 ,计算出了该类认证码被成功的模仿攻击的最大概率 PI及被成功的替换攻击的最大概率 PS.A construction of Cartesian Authentication Codes from 2 by 2 Quasi diagonal matrices over finite fields are presented and their size parameters are computed.Moreover,assuming that the encoding rules are chosen according to a uniform probability distribution,the P I and P S ,which denote the largest probabilities of a successful impersonation attack and a successful substitution attack respectively of this codes are also computed.

关 键 词：认证码 有限域 准对角矩阵 信息系统 

分 类 号：O152[理学—数学]