量子密码协议设计与量子搜索算法应用研究

发布时间：2018-07-29 15:52

【摘要】：随着通信技术与计算机研究的快速发展,人与人之间信息交互变得越发广泛和频繁,信息安全也越来越重要。而人类计算能力的显著提高,特别是量子并行算法的提出,基于计算复杂性的经典密码体制安全性受到了严重威胁。量子密码是量子力学和经典密码学相互融合的产物,它的安全性由量子力学基本原理保证,与攻击者的计算能力无关。因此,量子密码受到信息安全研究者的重视,其研究范围非常广泛,例如量子密钥分配、量子秘密共享、量子身份认证、量子安全直接通信等。当前的理论和实验表明,量子密码将是下一代信息安全体系的重要组成部分。本论文主要研究了量子秘密共享和量子安全直接通信协议,并对量子算法设计进行了一些探索,取得了一些研究成果。具体如下:1.本文基于动态增减用户以及群组间共享秘密信息的需求,利用两种不同的簇态设计了一种动态的多方与多方量子秘密共享方案。该方案除能实现上述需求外,秘密生成方也能通过全体成员的合作恢复出信息;同时,由于簇态独特的纠缠性质,该方案不仅能抵抗纠缠系统攻击和成员内部欺骗攻击,除了因检测窃听需要消耗部分粒子外,密钥恢复方的其余粒子都参与密钥的共享,因此整个方案有较高的安全性和效率性。2.在量子安全直接通信中,本文基于两粒子部分纠缠态提出一种高效量子安全直接通信方案。通信双方分别通过受控非操作和局域幺正变换编码秘密消息,利用von Neumann测量,结合经典通信实现秘密消息的高效双向直接传递。由于通信双方共享两个不对称的量子信道和不同的编码操作,在恢复秘密消息时通信双方各自持有攻击者不能掌握的关键量子比特,使得协议在理想和噪声信道中均是安全的。3.量子算法研究方面,本文基于Grover量子无序搜索算法和生日攻击方案,改进了原量子碰撞搜索算法。结合中间相遇攻击方案,以计算复杂度74.7?(2)实现对经典New FORK-256 Hash算法的碰撞搜索,并证明了改进方法的正确性和高效性。最后对比了不同碰撞方案的攻击效率。
[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.
【学位授予单位】：解放军信息工程大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：O413;TN918.4

【参考文献】