%0 Conference Paper
%A Martínez Mateo, Jesús
%A Rosales Bejarano, José Luis
%A Martín Ayuso, Vicente
%B 5th International Conference on Quantum Cryptography
%C Tokio, Japón
%D 2015
%F upm:37660
%P 1-1
%T Rate-Adaptive LDPC-based key reconciliation for high performance quantum key distribution
%U http://oa.upm.es/37660/
%X The postprocessing or secret-key distillation process in quantum key distribution (QKD) mainly involves two well-known procedures: information reconciliation and privacy amplification. Information or key reconciliation has been customarily studied in terms of efficiency. During this, some information needs to be disclosed for reconciling discrepancies in the exchanged keys. The leakage of information is lower bounded by a theoretical limit, and is usually parameterized by the reconciliation efficiency (or inefficiency), i.e. the ratio of additional information disclosed over the Shannon limit. Most techniques for reconciling errors in QKD try to optimize this parameter. For instance, the well-known Cascade (probably the most widely used procedure for reconciling errors in QKD) was recently shown to have an average efficiency of 1.05 at the cost of a high interactivity (number of exchanged messages). Modern coding techniques, such as rate-adaptive low-density parity-check (LDPC) codes were also shown to achieve similar efficiency values exchanging only one message, or even better values with few interactivity and shorter block-length codes.