Novo método de quantização para protocolos de reconciliação de chaves secretas geradas quanticamente utilizando códigos LDPC no sentido Slepian-Wolf.

Abstract

This work presents an alternative solution to the use of Slice functions for reconciliation of continuous random variables in a context of generating secret keys for cryptographic purposes spelling. The proposed reconciliation protocol is based on the probability distribution function of random variables and is shown to be a competitive method for its ability to produce more bits per continuous variable realization than the current scheme in use, for low SNR values, with an advantage of lower iteration. The process error correction is based on the use of LDPC codes from a compression of the sequence of bits to be used as a key, based on the Slepian-Wolf theorem, minimizing the information leaked by the classic channel – assumed perfect – for a possible spy watching the channel.