pith. sign in

arxiv: 1205.0842 · v3 · pith:GVRZ5TIZnew · submitted 2012-05-04 · 🪐 quant-ph

A min-entropy uncertainty relation for finite size cryptography

classification 🪐 quant-ph
keywords uncertaintyrelationsmin-entropyblockcryptographicinterestlengthsprotocols
0
0 comments X
read the original abstract

Apart from their foundational significance, entropic uncertainty relations play a central role in proving the security of quantum cryptographic protocols. Of particular interest are thereby relations in terms of the smooth min-entropy for BB84 and six-state encodings. Previously, strong uncertainty relations were obtained which are valid in the limit of large block lengths. Here, we prove a new uncertainty relation in terms of the smooth min-entropy that is only marginally less strong, but has the crucial property that it can be applied to rather small block lengths. This paves the way for a practical implementation of many cryptographic protocols. As part of our proof we show tight uncertainty relations for a family of Renyi entropies that may be of independent interest.

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.