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

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

2007-02-27

arxiv.org/abs/quant-ph/0702250v4

Physical Review A, 76, 012329 (2007)

Physics

Quantum Physics

Scientific paper

10.1103/PhysRevA.76.012329

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.

Affiliated with

Also associated with

No associations

Rating

Upper bounds of eavesdropper's performances in finite-length code with decoy method 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 Upper bounds of eavesdropper's performances in finite-length code with decoy method, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Upper bounds of eavesdropper's performances in finite-length code with decoy method will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-207725