| 利用辛对合矩阵构造Cartesian认证码 |
| |
| 引用本文： | 韩振芳,徐永春. 利用辛对合矩阵构造Cartesian认证码[J]. 数学的实践与认识, 2006, 36(5): 280-284 |
| |
| 作者姓名： | 韩振芳 徐永春 |
| |
| 作者单位： | 河北北方学院理学院数学系,河北,张家口,075000 |
| |
| 摘 要： | 利用辛对合矩阵构作了一个C artesian认证码,并且计算了其参数.假设编码规则是按均匀概率分布选取时,计算了模仿攻击成功的概率PI和替换攻击成功的概率PS.
|
| 关 键 词： | 有限域 认证码 辛对合矩阵 |
| 修稿时间： | 2006-02-07 |
Using Symplectic Involutory Matrices over Finite Fields to Construct Cartesian Aythentication Codes |
| |
| HAN Zhen-fang,XU Yong-chun. Using Symplectic Involutory Matrices over Finite Fields to Construct Cartesian Aythentication Codes[J]. Mathematics in Practice and Theory, 2006, 36(5): 280-284 |
| |
| Authors: | HAN Zhen-fang XU Yong-chun |
| |
| Abstract: | In this paper,one construction of Cartesian authentication codes from symplectic involutory matrices over finite fields are presented and its size parameters are computed.Moreover,assume that the encoding rules are chosen according to uniform probability distribution,the P_I and P_S,which denote the largest probability of a successful impersonation attack and a successful substitution attack respectively,of these codes are alse computed. |
| |
| Keywords: | finite field authentication codes symplectic involutory matrices |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
