Leftover hashing from quantum error correction: Unifying the two approaches to the security proof of quantum key distribution
share
Privacy amplification (PA) is an important building block in cryptography, both classical and quantum, and the leftover hashing lemma (LHL) is the standard theoretical tool used for guaranteeing its security. We present here a direct connection between the LHL and the coding theorem of a certain quantum error correction code. As an application of this result, we also demonstrate that there is a direct connection between the two major approaches to the security analysis of quantum key distribution: the Mayers-Shor-Preskill approach and Renner's approach.
READ FULL TEXT