Large deviation analysis for quantum security via smoothing of Renyi entropy of order 2
This provides incremental theoretical security analysis for quantum cryptography protocols.
The paper tackles security evaluation in classical and quantum settings by deriving exponential security bounds for L1 distinguishability and modified mutual information using smoothing of Rényi entropy of order 2, and extends these results to ε-almost dual universal₂ hash functions with application to secret key generation with error correction.
It is known that the security evaluation can be done by smoothing of Rényi entropy of order 2 in the classical and quantum settings when we apply universal$_2$ hash functions. Using the smoothing of Renyi entropy of order 2, we derive security bounds for $L_1$ distinguishability and modified mutual information criterion under the classical and quantum setting, and have derived these exponential decreasing rates. These results are extended to the case when we apply $\varepsilon$-almost dual universal$_2$ hash functions. Further, we apply this analysis to the secret key generation with error correction.