|
| related topics |
| {key, protocol, security} |
| {alice, bob, state} |
| {error, code, errors} |
| {entanglement, phys, rev} |
| {photon, photons, single} |
| {qubit, qubits, gate} |
| {phase, path, phys} |
|
BDSW protocol revisited: an efficient method for the key distillation
without classical computational complexity
Xiang-Bin Wang
abstract: In quantum key distribution(QKD), one can use a classical CSS code to distill
the final key. However, there is a constraint for the two codes in CSS code and
so far it is unknown how to construct a large CSS code efficiently. Here we
show that the BDSW method given by Bennett et al can be modified and the error
correction and privacy amplification can be done separately with two
INDEPENDENT parity matrices. With such a modification, BDSW method can be used
to distill the final key without any classical computational complexity. We
also apply the method to the case of imperfect source where a small fraction of
signals are tagged by Eve.
- oai_identifier:
- oai:arXiv.org:quant-ph/0409099
- categories:
- quant-ph
- arxiv_id:
- quant-ph/0409099
- created:
- 2004-09-16
- updated:
- 2004-09-22
Full article ▸
|
|
| related documents |
| 0703099v5 |
| 0205060v3 |
| 0304035v1 |
| 0107130v1 |
| 0403036v5 |
| 0410215v2 |
| 0505108v1 |
| 0310168v2 |
| 0410017v2 |
| 0111073v2 |
| 0211153v5 |
| 0503192v4 |
| 9911043v5 |
| 0611145v1 |
| 0504150v2 |
| 0503002v1 |
| 0503157v1 |
| 0603234v1 |
| 0509211v1 |
| 9810067v3 |
| 0508002v2 |
| 0610096v2 |
| 0702155v3 |
| 0511163v2 |
| 0501075v1 |
|