pith. sign in

arxiv: quant-ph/0702250 · v4 · submitted 2007-02-27 · 🪐 quant-ph

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

classification 🪐 quant-ph
keywords codecountsdarkdecoyfinite-lengthformulasmethodsecurity
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.