Efficient reconciliation protocol for discrete-variable quantum key distribution

David Elkouss, Anthony Leverrier, Romain Alĺeaume, Joseph J. Boutros

Research output: Chapter in Book/Report/Conference proceedingConference contribution

70 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publication2009 IEEE International Symposium on Information Theory, ISIT 2009
Pages1879-1883
Number of pages5
DOIs
Publication statusPublished - 19 Nov 2009
Event2009 IEEE International Symposium on Information Theory, ISIT 2009 - Seoul, Korea, Republic of
Duration: 28 Jun 20093 Jul 2009

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8102

Other

Other2009 IEEE International Symposium on Information Theory, ISIT 2009
CountryKorea, Republic of
CitySeoul
Period28/6/093/7/09

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

Cite this

Elkouss, D., Leverrier, A., Alĺeaume, R., & Boutros, J. J. (2009). Efficient reconciliation protocol for discrete-variable quantum key distribution. In 2009 IEEE International Symposium on Information Theory, ISIT 2009 (pp. 1879-1883). [5205475] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2009.5205475