【摘要】：隨著通信技術(shù)與計(jì)算機(jī)研究的快速發(fā)展,人與人之間信息交互變得越發(fā)廣泛和頻繁,信息安全也越來(lái)越重要。而人類計(jì)算能力的顯著提高,特別是量子并行算法的提出,基于計(jì)算復(fù)雜性的經(jīng)典密碼體制安全性受到了嚴(yán)重威脅。量子密碼是量子力學(xué)和經(jīng)典密碼學(xué)相互融合的產(chǎn)物,它的安全性由量子力學(xué)基本原理保證,與攻擊者的計(jì)算能力無(wú)關(guān)。因此,量子密碼受到信息安全研究者的重視,其研究范圍非常廣泛,例如量子密鑰分配、量子秘密共享、量子身份認(rèn)證、量子安全直接通信等。當(dāng)前的理論和實(shí)驗(yàn)表明,量子密碼將是下一代信息安全體系的重要組成部分。本論文主要研究了量子秘密共享和量子安全直接通信協(xié)議,并對(duì)量子算法設(shè)計(jì)進(jìn)行了一些探索,取得了一些研究成果。具體如下:1.本文基于動(dòng)態(tài)增減用戶以及群組間共享秘密信息的需求,利用兩種不同的簇態(tài)設(shè)計(jì)了一種動(dòng)態(tài)的多方與多方量子秘密共享方案。該方案除能實(shí)現(xiàn)上述需求外,秘密生成方也能通過(guò)全體成員的合作恢復(fù)出信息;同時(shí),由于簇態(tài)獨(dú)特的糾纏性質(zhì),該方案不僅能抵抗糾纏系統(tǒng)攻擊和成員內(nèi)部欺騙攻擊,除了因檢測(cè)竊聽需要消耗部分粒子外,密鑰恢復(fù)方的其余粒子都參與密鑰的共享,因此整個(gè)方案有較高的安全性和效率性。2.在量子安全直接通信中,本文基于兩粒子部分糾纏態(tài)提出一種高效量子安全直接通信方案。通信雙方分別通過(guò)受控非操作和局域幺正變換編碼秘密消息,利用von Neumann測(cè)量,結(jié)合經(jīng)典通信實(shí)現(xiàn)秘密消息的高效雙向直接傳遞。由于通信雙方共享兩個(gè)不對(duì)稱的量子信道和不同的編碼操作,在恢復(fù)秘密消息時(shí)通信雙方各自持有攻擊者不能掌握的關(guān)鍵量子比特,使得協(xié)議在理想和噪聲信道中均是安全的。3.量子算法研究方面,本文基于Grover量子無(wú)序搜索算法和生日攻擊方案,改進(jìn)了原量子碰撞搜索算法。結(jié)合中間相遇攻擊方案,以計(jì)算復(fù)雜度74.7?(2)實(shí)現(xiàn)對(duì)經(jīng)典New FORK-256 Hash算法的碰撞搜索,并證明了改進(jìn)方法的正確性和高效性。最后對(duì)比了不同碰撞方案的攻擊效率。
[Abstract]:With the rapid development of communication technology and computer research, information interaction between people becomes more and more extensive and frequent, and information security is becoming more and more important. The significant improvement of human computing power, especially the proposed quantum parallel algorithm, is a serious threat to the security of the classical secret code system based on Computational complexity. It is the product of the integration of quantum mechanics and classical cryptography. Its security is guaranteed by the basic principles of quantum mechanics and has nothing to do with the computing power of the attackers. Therefore, quantum cryptography has been paid much attention by the researchers of information security, and its research scope is very wide, such as quantum key distribution, quantum secret sharing, quantum authentication, quantum security. The current theories and experiments show that quantum cryptography will be an important part of the next generation information security system. This paper mainly studies the quantum secret sharing and the quantum security direct communication protocol, and has carried out some research on the design of quantum algorithms and obtained some research results. 1. this paper is based on the dynamics of this paper. A dynamic multi-party and multi party quantum secret sharing scheme is designed by two different cluster states. In addition to the above requirements, the secret generator can also restore the information through the cooperation of all members. At the same time, the scheme has the unique entanglement property of cluster states. Not only can we resist the entanglement system attack and the internal deception attack, except for the need to consume some particles because of the detection eavesdropping, the other particles of the key recovery party are involved in the sharing of the key, so the whole scheme has high security and efficiency in the quantum security direct communication. This paper is based on the two particle entanglement state. High efficient quantum secure direct communication scheme. The communication parties encode secret messages by controlled non operation and local unitary transformation respectively, using von Neumann measurement, combined with classical communication to achieve high efficient and direct transmission of secret messages. Since the two parties share two asymmetric quantum subchannels and different coding operations, the secret message is restored to the secret. In the message, the two parties each hold the key qubits that the attacker cannot master, making the protocol a secure.3. quantum algorithm in the ideal and noisy channels. Based on the Grover quantum disorder search algorithm and the birthday attack scheme, the original quantum collision search algorithm is improved. The complexity of 74.7? (2) realizes the collision search for the classical New FORK-256 Hash algorithm, and proves the correctness and efficiency of the improved method. Finally, the attack efficiency of different collision schemes is compared.
【學(xué)位授予單位】：解放軍信息工程大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：O413;TN918.4

【參考文獻(xiàn)】

相關(guān)期刊論文 前8條

1 杜宇韜;鮑皖蘇;;一類多方與多方量子秘密共享方案[J];信息工程大學(xué)學(xué)報(bào);2013年03期

2 許娟;陳漢武;劉文杰;劉志昊;;無(wú)糾纏量子秘密共享中酉操作的選擇[J];中國(guó)科學(xué):信息科學(xué);2011年07期

3 張盛;張守林;王劍;唐朝京;;基于壓縮態(tài)的多方與多方量子秘密共享[J];中國(guó)科學(xué):物理學(xué) 力學(xué) 天文學(xué);2011年07期

4 ;Quantum secret sharing between multiparty and multiparty with Bell states and Bell measurements[J];Science China(Physics,Mechanics & Astronomy);2010年12期

5 ;Eavesdropping in a quantum secret sharing protocol based on Grover algorithm and its solution[J];Science China(Physics,Mechanics & Astronomy);2010年03期

6 王劍;張盛;張守林;張權(quán);;基于純糾纏態(tài)的量子安全直接通信協(xié)議[J];國(guó)防科技大學(xué)學(xué)報(bào);2009年02期

7 高飛;郭奮卓;溫巧燕;朱甫臣;;Ping-pong協(xié)議中不同檢測(cè)策略的效率比較[J];中國(guó)科學(xué)(G輯:物理學(xué) 力學(xué) 天文學(xué));2009年02期

8 夏培肅;量子計(jì)算[J];計(jì)算機(jī)研究與發(fā)展;2001年10期

，

本文編號(hào)：2153177