TY - GEN
T1 - Efficient reconciliation protocol for discrete-variable quantum key distribution
AU - Elkouss, David
AU - Leverrier, Anthony
AU - Alĺeaume, Romain
AU - Boutros, Joseph J.
PY - 2009/11/19
Y1 - 2009/11/19
N2 - Reconciliation is an essential part of any secret-key agreement protocol and hence of a Quantum Key Distribution (QKD) protocol, where two legitimate parties are given correlated data and want to agree on a common string in the presence of an adversary, while revealing a minimum amount of information. In this paper, we show that for discrete-variable QKD protocols, this problem can be advantageously solved with Low Density Parity Check (LDPC) codes optimized for the binary symmetric channel (BSC). In particular, we demonstrate that our method leads to a significant improvement of the achievable secret key rate, with respect to earlier interactive reconciliation methods used in QKD.
AB - Reconciliation is an essential part of any secret-key agreement protocol and hence of a Quantum Key Distribution (QKD) protocol, where two legitimate parties are given correlated data and want to agree on a common string in the presence of an adversary, while revealing a minimum amount of information. In this paper, we show that for discrete-variable QKD protocols, this problem can be advantageously solved with Low Density Parity Check (LDPC) codes optimized for the binary symmetric channel (BSC). In particular, we demonstrate that our method leads to a significant improvement of the achievable secret key rate, with respect to earlier interactive reconciliation methods used in QKD.
U2 - 10.1109/ISIT.2009.5205475
DO - 10.1109/ISIT.2009.5205475
M3 - Conference contribution
AN - SCOPUS:70449485057
SN - 9781424443130
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1879
EP - 1883
BT - 2009 IEEE International Symposium on Information Theory, ISIT 2009
T2 - 2009 IEEE International Symposium on Information Theory, ISIT 2009
Y2 - 28 June 2009 through 3 July 2009
ER -