Rate-Adaptive LDPC-based key reconciliation for high performance quantum key distribution

Martínez Mateo, Jesús and Rosales Bejarano, José Luis and Martín Ayuso, Vicente (2015). Rate-Adaptive LDPC-based key reconciliation for high performance quantum key distribution. In: "5th International Conference on Quantum Cryptography", 28 Sep-02 Oct 2015, Tokio, Japón. p. 1.

Description

Title: Rate-Adaptive LDPC-based key reconciliation for high performance quantum key distribution
Author/s:
  • Martínez Mateo, Jesús
  • Rosales Bejarano, José Luis
  • Martín Ayuso, Vicente
Item Type: Presentation at Congress or Conference (Poster)
Event Title: 5th International Conference on Quantum Cryptography
Event Dates: 28 Sep-02 Oct 2015
Event Location: Tokio, Japón
Title of Book: QCrypt 2015
Date: 2015
Subjects:
Faculty: E.T.S. de Ingenieros Informáticos (UPM)
Department: Matemática Aplicada a las Tecnologías de la Información y las Comunicaciones
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 (175kB) | Preview

Abstract

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.

More information

Item ID: 37660
DC Identifier: http://oa.upm.es/37660/
OAI Identifier: oai:oa.upm.es:37660
Official URL: http://2015.qcrypt.net/scientific-program/
Deposited by: Memoria Investigacion
Deposited on: 13 May 2016 12:22
Last Modified: 13 May 2016 12:22
  • 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