Fast, efficient error reconciliation for quantum cryptography

被引：131

作者：

Buttler, WT ^{[1
]}

Lamoreaux, SK ^{[1
]}

Torgerson, JR ^{[1
]}

Nickel, GH ^{[1
]}

Donahue, CH ^{[1
]}

Peterson, CG ^{[1
]}

机构：

[1] Los Alamos Natl Lab, Los Alamos, NM 87545 USA

来源：

PHYSICAL REVIEW A | 2003年 / 67卷 / 05期

关键词：

D O I：

10.1103/PhysRevA.67.052303

中图分类号：

O43 [光学];

学科分类号：

070207 ; 0803 ;

摘要：

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.

引用

页数：8

共 31 条

[1]

Bennett C. H., 1992, Journal of Cryptology, V5, P3, DOI 10.1007/BF00191318

[2]

Bennett C. H., 1984, PROC IEEE INT C COMP, P175, DOI [DOI 10.1016/J.TCS.2014.05.025, 10.1016/j.tcs.2014.05.025]

[3] COMMUNICATION VIA ONE-PARTICLE AND 2-PARTICLE OPERATORS ON EINSTEIN-PODOLSKY-ROSEN STATES [J].