论文标题
用于在SHA-1中查找碰撞障碍向量的量子算法
A quantum algorithm for finding collision-inducing disturbance vectors in SHA-1
论文作者
论文摘要
现代加密协议依靠复杂的哈希功能来生成准唯一的数字，这些数字是用户身份验证和其他安全验证的签名。通过查找可与相同数字贴上的文本贴上的文本，形成所谓的碰撞攻击，可以妥协安全性。在哈希映射中播种干扰向量以获得成功的碰撞，这是过去二十年来加密研究的主要重点以改善哈希协议。我们提出了一种算法，该算法利用纠缠量子状态以及候选干扰向量的并发播种，其中一个需要碰撞，通过量子搜索，相位门控，扩散门控和从类别计算机械的信息反馈选择。降低的复杂性降低显示为$ \ Mathcal {o}（2^{n/2+1}）$，其中$ n $是Qubits编码地址的数量。我们证明了基于退化光学参数振荡器的实施方案提出的实用性。
Modern cryptographic protocols rely on sophisticated hash functions to generate quasi-unique numbers that serve as signatures for user authentication and other security verifications. The security could be compromised by finding texts hash-mappable to identical numbers, forming so-called collision attack. Seeding a disturbance vector in the hash mapping to obtain a successful collision is that a major focus of cryptography study in the past two decades to improve hash protocols. We propose an algorithm that takes advantage of entangled quantum states for concurrent seeding of candidate disturbance vectors, out of which the one entailing collision is selected through a combination of quantum search, phase gating, diffusion gating, and information feedbacks from classical computing machinery. The complexity reduction is shown to be on the order of $\mathcal{O}(2^{n/2+1})$ where $n$ is the number of qubits encoding addresses. We demonstrate the practicality of the proposed by an implementation scheme based on degenerate optical parametric oscillators.
