Fast, efficient error reconciliation for quantum cryptography

Details Fast, efficient error reconciliation for quantum cryptography Fast, efficient error reconciliation for quantum cryptography

2002-03-19

arxiv.org/abs/quant-ph/0203096v2

Physics

Quantum Physics

8 pages, 1 figure, 3 tables. This resubmission constitutes a referee modified response. In addition, the probabilities were in

Scientific paper

10.1103/PhysRevA.67.052303

We describe a new error reconciliation protocol {\it Winnow} based on the exchange of parity and Hamming's ``syndrome'' for $N-$bit subunits of a large data set. {\it Winnow} 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 Winnow 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 Winnow is due largely to the reduction in authenticated public communication required for its implementation.

Affiliated with

Also associated with

No associations

Rating

Fast, efficient error reconciliation for quantum cryptography does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fast, efficient error reconciliation for quantum cryptography, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast, efficient error reconciliation for quantum cryptography will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-620411