基于有限域上的射影空间构造完善的A^3码  

Construction of perfect A^3-codes from projective geometry over finite fields

作　　者：陈尚弟[1] 梁俊英 CHEN Shangdi, LIANG Junying(College of Science, CAUC, Tianjin 300300, Chin)

机构地区：[1]中国民航大学理学院

出　　处：《中国民航大学学报》2018年第2期59-64,共6页Journal of Civil Aviation University of China

基　　金：中央高校基本科研业务费专项(3122016L005)

摘　　要：为了解决具有仲裁的认证码中仲裁不可信的问题,提出了A^3码的概念。在认证系统中,3个参与方(发方、收方和仲裁方)都不可信,这是一个符合现实环境的认证系统,具有广泛的应用前景。运用有限域上射影几何的子空间结构和计数方法,构造了一个完善的A^3码,给出所构造码的参数,计算该码受到的各种攻击成功的最大概率。与一些已知的A^3码相比,该码有明显的优势。仿真结果表明,该码具有良好的安全性。To solve the problem of incredible arbitration in the authentication codes with arbitration, the concept of A^3-codes is proposed. In an A^3 -code, none of the three participants is assumed trustable including transmitter,receiver and arbiter. This authentication system is more suitable for realistic environment with extensiveapplication prospect. A perfect A^3 -code is constructed by using subspace structure and counting method ofprojective geometry over finite fields, parameters of the constructed code are given, and the maximum successprobabilities of various cheating attacks are also calculated. Compared with some known A^3 codes, this code hasobvious advantages. Simulation results show that this code has good security.

关 键 词：A^3码 射影几何 有限域 

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