Abstract
I review the ideas and main results in the derivation of security bounds in quantum key distribution for keys of finite length. In particular, all the detailed studies on specific protocols and implementations indicate that no secret key can be extracted if the number of processed signals per run is smaller than 10^5-10^6. I show how these numbers can be recovered from very basic estimates.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.