Fast, efficient error reconciliation for quantum cryptography
Fast, efficient error reconciliation for quantum cryptography
复制标题
DOI：
10.1103/physreva.67.052303
复制
发表时间：
2003-05-01
影响因子：
2.9
通讯作者：
Peterson, CG
中科院分区：
文献类型：
--
作者：
Buttler, WT;Lamoreaux, SK;Peterson, CG
我们描述了一种错误协调协议，我们称之为 Winnow，它基于大型数据集 N 位子单元的奇偶校验交换和汉明“综合症”。 Winnow 协议是在量子密钥分发的背景下开发的，与量子密码学界其他广泛使用的协议相比，它具有显着的优势和更高的净效率。在量子密钥分发的实际实现的背景下，对 Winnow 协议进行了详细的数学分析；特别是，安全实施所需的信息开销是评估特定错误协调协议的最重要标准之一。 Winnow 协议效率的提高很大程度上是由于其实施所需的经过身份验证的公共通信的减少。
We describe an error-reconciliation protocol, which we call Winnow, based on the exchange of parity and Hamming's "syndrome" for N-bit subunits of a large dataset. The Winnow protocol was developed in the context of quantum-key distribution and offers significant advantages and net higher efficiency compared to other widely used protocols within the quantum cryptography community. A detailed mathematical analysis of the Winnow protocol is presented in the context of practical implementations of quantum-key distribution; in particular, the information overhead required for secure implementation is one of the most important criteria in the evaluation of a particular error-reconciliation protocol. The increase in efficiency for the Winnow protocol is largely due to the reduction in authenticated public communication required for its implementation.