Efficient reconciliation protocol for discrete-variable quantum key distribution

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

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

65 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

Other

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

Fingerprint

Quantum cryptography
Quantum Key Distribution
Reconciliation
Discrete Variables
Key Agreement Protocol
Correlated Data
Low-density Parity-check (LDPC) Codes
Strings
Binary
Demonstrate

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. (2009). Efficient reconciliation protocol for discrete-variable quantum key distribution. In 2009 IEEE International Symposium on Information Theory, ISIT 2009 (pp. 1879-1883). [5205475] https://doi.org/10.1109/ISIT.2009.5205475

Efficient reconciliation protocol for discrete-variable quantum key distribution. / Elkouss, David; Leverrier, Anthony; Alĺeaume, Romain; Boutros, Joseph.

2009 IEEE International Symposium on Information Theory, ISIT 2009. 2009. p. 1879-1883 5205475.

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

Elkouss, D, Leverrier, A, Alĺeaume, R & Boutros, J 2009, Efficient reconciliation protocol for discrete-variable quantum key distribution. in 2009 IEEE International Symposium on Information Theory, ISIT 2009., 5205475, pp. 1879-1883, 2009 IEEE International Symposium on Information Theory, ISIT 2009, Seoul, Korea, Republic of, 28/6/09. https://doi.org/10.1109/ISIT.2009.5205475
Elkouss D, Leverrier A, Alĺeaume R, Boutros J. Efficient reconciliation protocol for discrete-variable quantum key distribution. In 2009 IEEE International Symposium on Information Theory, ISIT 2009. 2009. p. 1879-1883. 5205475 https://doi.org/10.1109/ISIT.2009.5205475
Elkouss, David ; Leverrier, Anthony ; Alĺeaume, Romain ; Boutros, Joseph. / Efficient reconciliation protocol for discrete-variable quantum key distribution. 2009 IEEE International Symposium on Information Theory, ISIT 2009. 2009. pp. 1879-1883
@inproceedings{6f6e69afd34a405d8bc9c62288bc1b7c,
title = "Efficient reconciliation protocol for discrete-variable quantum key distribution",
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.",
author = "David Elkouss and Anthony Leverrier and Romain Alĺeaume and Joseph Boutros",
year = "2009",
month = "11",
day = "19",
doi = "10.1109/ISIT.2009.5205475",
language = "English",
isbn = "9781424443130",
pages = "1879--1883",
booktitle = "2009 IEEE International Symposium on Information Theory, ISIT 2009",

}

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

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.

UR - http://www.scopus.com/inward/record.url?scp=70449485057&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70449485057&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2009.5205475

DO - 10.1109/ISIT.2009.5205475

M3 - Conference contribution

AN - SCOPUS:70449485057

SN - 9781424443130

SP - 1879

EP - 1883

BT - 2009 IEEE International Symposium on Information Theory, ISIT 2009

ER -