Upper bounds of eavesdropper's performances in finite-length code with decoy method

Masahito Hayashi

doi:10.1103/PhysRevA.76.012329

Upper bounds of eavesdropper's performances in finite-length code with decoy method

Quantum Physics 2009-11-13 v4

Authors: Masahito Hayashi

View on arXiv ↗ PDF ↗ DOI ↗

Abstract

Security formulas of quantum key distribution (QKD) with imperfect resources are obtained for finite-length code when the decoy method is applied. This analysis is useful for guaranteeing the security of implemented QKD systems. Our formulas take into account the effect of the vacuum state and dark counts in the detector. We compare the asymptotic key generation rate in presence of dark counts with that without.

Keywords

quantum key distribution quantum cryptography quantum error correction

Cite

@article{arxiv.quant-ph/0702250,
  title  = {Upper bounds of eavesdropper's performances in finite-length code with decoy method},
  author = {Masahito Hayashi},
  journal= {arXiv preprint arXiv:quant-ph/0702250},
  year   = {2009}
}

Related papers

View all related →