摘要
给出 2 -幂零矩阵的Jordan标准型在相似变换下的稳定群的结构 ,利用有限域上 2 -幂零矩阵构作了一个Cartesian认证码 ,计算出了该认证码的参数 .在假定编码规则按等概率分布选取的条件下 ,计算出了该认证码被成功的模仿攻击的最大概率PI 及被成功的替换攻击的最大概率PS.
We give the structure of the stable group of the Jordan's normal form of 2-nilpotent matrices under the similarity transformation.One construction of Cartesian authentication codes from 2-nilpotent matrices over a finite fields is presented and its size parameters are computed.Moreover,assume 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 of a successful substitution attack respectively,of these codes are also computed.
出处
《应用数学》
CSCD
北大核心
2004年第3期383-388,共6页
Mathematica Applicata
基金
江南大学 2 11基金 (314 0 0 0 2 10 5 0 30 6 )
