Efficient reconciliation with rate adaptive codes in quantum key distribution.

Elkouss Coronas, David (2011). Efficient reconciliation with rate adaptive codes in quantum key distribution.. "Quantum Information And Computation", v. null (n. null); pp. 226-238. ISSN 1533-7146.

Description

Title: Efficient reconciliation with rate adaptive codes in quantum key distribution.
Author/s:
  • Elkouss Coronas, David
Item Type: Article
Título de Revista/Publicación: Quantum Information And Computation
Date: March 2011
ISSN: 1533-7146
Volume: null
Subjects:
Faculty: Facultad de Informática (UPM)
Department: Lenguajes y Sistemas Informáticos e Ingeniería del Software
Creative Commons Licenses: Recognition - No derivative works - Non commercial

Full text

[img]
Preview
PDF - Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (263kB) | Preview

Abstract

Quantum key distribution (QKD) relies on quantum and classical procedures in order to achieve the growing of a secret random string ¿the key¿ known only to the two parties executing the protocol. Limited intrinsic efficiency of the protocol, imperfect devices and eavesdropping produce errors and information leakage from which the set of measured signals ¿the raw key¿ must be stripped in order to distill a final, information theoretically secure, key. The key distillation process is a classical one in which basis reconciliation, error correction and privacy amplification protocols are applied to the raw key. This cleaning process is known as information reconciliation and must be done in a fast and efficient way to avoid cramping the performance of the QKD system. Brassard and Salvail proposed a very simple and elegant protocol to reconcile keys in the secret- key agreement context, known as Cascade, that has become the de-facto standard for all QKD practical implementations. However, it is highly interactive, requiring many com- munications between the legitimate parties and its efficiency is not optimal, imposing an early limit to the maximum tolerable error rate. In this paper we describe a low-density parity-check reconciliation protocol that improves significantly on these problems. The protocol exhibits better efficiency and limits the number of uses of the communications channel. It is also able to adapt to different error rates while remaining efficient, thus reaching longer distances or higher secure key rate for a given QKD system.

More information

Item ID: 9623
DC Identifier: http://oa.upm.es/9623/
OAI Identifier: oai:oa.upm.es:9623
Deposited by: Memoria Investigacion
Deposited on: 12 Dec 2011 11:41
Last Modified: 30 Nov 2015 09:01
  • Logo InvestigaM (UPM)
  • Logo GEOUP4
  • Logo Open Access
  • Open Access
  • Logo Sherpa/Romeo
    Check whether the anglo-saxon journal in which you have published an article allows you to also publish it under open access.
  • Logo Dulcinea
    Check whether the spanish journal in which you have published an article allows you to also publish it under open access.
  • Logo de Recolecta
  • Logo del Observatorio I+D+i UPM
  • Logo de OpenCourseWare UPM