基于射影空间和辛空间构作A~3-码
发布时间：2018-09-01 15:32
【摘要】：一般带仲裁认证码(A2-码)中要求发方和收方必须完全相信仲裁,但事实上很多情况中仲裁不一定完全可信,甚至会对认证系统产生攻击,而对于仲裁人参与欺骗的情形A2-码却无能为力。A~3-码是一般带仲裁认证码的扩展,其中发方、收方和仲裁都是不可信的,仲裁也会对认证系统发起攻击,因此在A~3-码中为了避免自身不受外界攻击发方、收方和仲裁都有密钥信息。本文基于A2-码的构造以及A~3-码的相关定义,做了如下工作：1.基于有限域上射影空间构作A~3-码设0≤trm,F是射影空间PG(n,Fq)中的一个固定m-flat,R是包含在F中的一个固定t-flat。定义信源s是F中包含R的r-flat,发方密钥e是与F交于R的s-flat,收方密钥和仲裁密钥分别是与F交于R的(s-1)-flat,报文m是与F交于包含R的r-flat的(r+s-t)-flat。定义了发方的加密法则、收方的解密法则以及仲裁的仲裁法则,证明了构造的合理性,并计算了所构造A~3-码的参数和最大攻击概率。2.基于有限域上奇异伪辛空间构作A~3-码利用奇异伪辛几何中子空间的关联关系,构造了一个A~3-码,证明了所构造A~3-码的合理性,计算了相应参数,并在信源和密钥按等概率分布选取时,计算出了各种攻击成功的最大概率。
[Abstract]:Generally speaking, the authentication code with arbitration (A2-code) requires the issuer and the receiver to trust the arbitration completely, but in fact, in many cases, arbitration may not be completely credible and may even attack the authentication system. However, there is nothing that can be done about A2-code in the case where the arbitrator is involved in cheating. Af3- code is an extension of the general authentication code with arbitration, in which the sender, the receiver and the arbitration are all untrustworthy, and the arbitration will also attack the authentication system. Therefore, in order to avoid being attacked by the outside world, both the receiver and the arbitration have the key information. In this paper, based on the construction of A2-codes and the related definitions of A2-codes, we do the following work: 1. On the basis of projective spaces over finite fields, we construct a fixed m-flat R in a projective space PG (NQ) with a fixed t-flatn R contained in F if 0 鈮，
本文编号：2217613
[Abstract]:Generally speaking, the authentication code with arbitration (A2-code) requires the issuer and the receiver to trust the arbitration completely, but in fact, in many cases, arbitration may not be completely credible and may even attack the authentication system. However, there is nothing that can be done about A2-code in the case where the arbitrator is involved in cheating. Af3- code is an extension of the general authentication code with arbitration, in which the sender, the receiver and the arbitration are all untrustworthy, and the arbitration will also attack the authentication system. Therefore, in order to avoid being attacked by the outside world, both the receiver and the arbitration have the key information. In this paper, based on the construction of A2-codes and the related definitions of A2-codes, we do the following work: 1. On the basis of projective spaces over finite fields, we construct a fixed m-flat R in a projective space PG (NQ) with a fixed t-flatn R contained in F if 0 鈮，
本文编号：2217613
本文链接：https://www.wllwen.com/kejilunwen/wltx/2217613.html
