Paper
4 August 2003 Informed guessing of an eavesdropper's Renyi entropy
Author Affiliations +
Abstract
Users of a quantum cryptographic system face a problem of deciding on the ignorance of a maximally adroit eavesdropper concerning their key material. It is known that there can be no sure, positive, lower bound on any plausible measure of ignorance, and for this reason we characterize the problem as the making of an informed guess, meaning a guess that employs a rule that can be shown to work except in unlikely cases. As the measure of an eavesdropper's ignorance concerning n bits of sifted key material less some number k of bits found in error and discarded, we analyze Renyi entropy of arbitrary order R, for 1 ≤ R ≤ 2. We offer a rule for deciding on Renyi entropy based on a tighter bound on the relevant probability distributions than has been available. To this end, we employ a recently derived approximation to the cumulative binomial distribution which is uniformly accurate over a larger domain than previously available approximations. This results in a longer distilled key than that obtained from looser bounds, as well as generalizing the order R. Some numerical examples are presented.
© (2003) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
John M. Myers and Tai Tsun Wu "Informed guessing of an eavesdropper's Renyi entropy", Proc. SPIE 5105, Quantum Information and Computation, (4 August 2003); https://doi.org/10.1117/12.486994
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Error analysis

Defense and security

Inspection

Quantum key distribution

Quantum mechanics

Composites

Factor analysis

Back to Top