Abstract
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.
- Received 19 March 2002
DOI:https://doi.org/10.1103/PhysRevA.67.052303
©2003 American Physical Society