dorsal/arxiv
View SchemaFast, efficient error reconciliation for quantum cryptography
| Authors | W. T. Buttler, S. K. Lamoreaux, J. R. Torgerson, G. H. Nickel, C. H. Donahue, C. G. Peterson |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0203096 |
| URL | https://arxiv.org/abs/quant-ph/0203096 |
| DOI | 10.1103/PhysRevA.67.052303 |
Abstract
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.
{
"annotation_id": "c99185aa-5433-492a-8b95-5b9e2d68fcfa",
"date_created": "2026-03-02T18:01:49.153000Z",
"date_modified": "2026-03-02T18:01:49.153000Z",
"file_hash": "0e5948e399585e15d5864a74b65ab7300aaee52b598a6424e7fe7bb105239f2f",
"private": false,
"record": {
"abstract": "We describe a new error reconciliation protocol {\\it Winnow} based on the\nexchange of parity and Hamming\u0027s ``syndrome\u0027\u0027 for $N-$bit subunits of a large\ndata set. {\\it Winnow} was developed in the context of quantum key distribution\nand offers significant advantages and net higher efficiency compared to other\nwidely used protocols within the quantum cryptography community. A detailed\nmathematical analysis of Winnow is presented in the context of practical\nimplementations of quantum key distribution; in particular, the information\noverhead required for secure implementation is one of the most important\ncriteria in the evaluation of a particular error reconciliation protocol. The\nincrease in efficiency for Winnow is due largely to the reduction in\nauthenticated public communication required for its implementation.",
"arxiv_id": "quant-ph/0203096",
"authors": [
"W. T. Buttler",
"S. K. Lamoreaux",
"J. R. Torgerson",
"G. H. Nickel",
"C. H. Donahue",
"C. G. Peterson"
],
"categories": [
"quant-ph"
],
"doi": "10.1103/PhysRevA.67.052303",
"title": "Fast, efficient error reconciliation for quantum cryptography",
"url": "https://arxiv.org/abs/quant-ph/0203096"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "f95c525c-0651-4aec-af78-11b7291f7b49",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}