| 利用F_q~(n)的直和分解构作认证码 |
| |
| 引用本文： | 郭军. 利用F_q~(n)的直和分解构作认证码[J]. 河北大学学报(自然科学版), 2001, 0(2) |
| |
| 作者姓名： | 郭军 |
| |
| 作者单位： | 张家口师范专科学校数学系!河北张家口075028 |
| |
| 基金项目： | 河北省教育厅自然科学基金项目! (2 0 0 0 10 2 ) |
| |
| 摘 要： | 利用有限域上n维行向量空间的直和分解给出了构作Cartesian认证码的一种新方案 ,计算了这类认证码的参数 .在编码规则按等概率分布选取的假设下 ,给出了这类认证码被成功地模仿攻击的最大概率PI 和被成功地替换攻击的最大概率Ps.
|
| 关 键 词： | 认证码 直和分解 特征子空间 |
Constructions of Authentication Codes from Direct Sum Decompositions of F_q~(n) |
| |
| GUO Jun. Constructions of Authentication Codes from Direct Sum Decompositions of F_q~(n)[J]. Journal of Hebei University (Natural Science Edition), 2001, 0(2) |
| |
| Authors: | GUO Jun |
| |
| Abstract: | Construction of Cartesian authentication codes from direct sum decompositions of n-dimension at row vector space over finite field is presented,and the size paramenters of the code in construction are computed.Moveover,assume that the encoding rules are chosen according to the uniform probability distribution,the P I and P S which denote the largest probabililies of a successful impersonation attack and a successful substitution attack respectively of the code in construion are also computed. |
| |
| Keywords: | authentication code direct sum decomposition characteristic subspace |
| 本文献已被 CNKI 等数据库收录！ |
