基于射影空間和辛空間構(gòu)作A~3-碼
發(fā)布時(shí)間:2018-09-01 15:32
【摘要】:一般帶仲裁認(rèn)證碼(A2-碼)中要求發(fā)方和收方必須完全相信仲裁,但事實(shí)上很多情況中仲裁不一定完全可信,甚至?xí)䦟?duì)認(rèn)證系統(tǒng)產(chǎn)生攻擊,而對(duì)于仲裁人參與欺騙的情形A2-碼卻無(wú)能為力。A~3-碼是一般帶仲裁認(rèn)證碼的擴(kuò)展,其中發(fā)方、收方和仲裁都是不可信的,仲裁也會(huì)對(duì)認(rèn)證系統(tǒng)發(fā)起攻擊,因此在A~3-碼中為了避免自身不受外界攻擊發(fā)方、收方和仲裁都有密鑰信息。本文基于A2-碼的構(gòu)造以及A~3-碼的相關(guān)定義,做了如下工作:1.基于有限域上射影空間構(gòu)作A~3-碼設(shè)0≤trm,F是射影空間PG(n,Fq)中的一個(gè)固定m-flat,R是包含在F中的一個(gè)固定t-flat。定義信源s是F中包含R的r-flat,發(fā)方密鑰e是與F交于R的s-flat,收方密鑰和仲裁密鑰分別是與F交于R的(s-1)-flat,報(bào)文m是與F交于包含R的r-flat的(r+s-t)-flat。定義了發(fā)方的加密法則、收方的解密法則以及仲裁的仲裁法則,證明了構(gòu)造的合理性,并計(jì)算了所構(gòu)造A~3-碼的參數(shù)和最大攻擊概率。2.基于有限域上奇異偽辛空間構(gòu)作A~3-碼利用奇異偽辛幾何中子空間的關(guān)聯(lián)關(guān)系,構(gòu)造了一個(gè)A~3-碼,證明了所構(gòu)造A~3-碼的合理性,計(jì)算了相應(yīng)參數(shù),并在信源和密鑰按等概率分布選取時(shí),計(jì)算出了各種攻擊成功的最大概率。
[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 鈮,
本文編號(hào):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 鈮,
本文編號(hào):2217613
本文鏈接:http://sikaile.net/kejilunwen/wltx/2217613.html
最近更新
教材專著