基于2-Jordan型幂零阵的Cartesian认证码的构造  

Construction of Cartesian Authentication Codes Basedon Nilpotent Matrices with 2-Jordan Normal Form

作　　者：李殿龙[1] 骆吉洲[2] 

机构地区：[1]江南大学理学院,江苏无锡214063 [2]哈尔滨工业大学计算机科学与技术学院,黑龙江哈尔滨150001

出　　处：《数学的实践与认识》2005年第5期104-109,共6页Mathematics in Practice and Theory

基　　金：江南大学 2 1 1基金 (3 1 40 0 0 -2 1 0 5 0 3 0 6)

摘　　要：利用群在集合上的共轭作用,给出了一种由2 -Jordan型幂零矩阵构造Cartesian认证码的新方案,计算了相关参数,并在假定编码规则按等概率分布选取时分析了模仿攻击和替换攻击成功的概率.We describe a new construction of Cartesian authentication codes from nilpotent matrices with the 2-Jordan normal form by the ″conjugate action″ of a group on a set, and some its size parameters are computed. Moreover, assume that the encoding rules are chosen according to a uniform probability distribution, the largest probabilities of a successful impersonation attack and of a successful substitution attack of these codes are also computed.

关 键 词：CARTESIAN认证码 AN型 幂零阵 等概率分布 矩阵构造 攻击成功 模仿攻击 编码规则 新方案 共轭 集合 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]