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

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

Descripción

Título: Rate-Adaptive LDPC-based key reconciliation for high performance quantum key distribution
Autor/es:
  • Martínez Mateo, Jesús
  • Rosales Bejarano, José Luis
  • Martín Ayuso, Vicente
Tipo de Documento: Ponencia en Congreso o Jornada (Póster)
Título del Evento: 5th International Conference on Quantum Cryptography
Fechas del Evento: 28 Sep-02 Oct 2015
Lugar del Evento: Tokio, Japón
Título del Libro: QCrypt 2015
Fecha: 2015
Materias:
Escuela: E.T.S. de Ingenieros Informáticos (UPM)
Departamento: Matemática Aplicada a las Tecnologías de la Información y las Comunicaciones
Licencias Creative Commons: Reconocimiento - Sin obra derivada - No comercial

Texto completo

[img]
Vista Previa
PDF (Document Portable Format) - Se necesita un visor de ficheros PDF, como GSview, Xpdf o Adobe Acrobat Reader
Descargar (175kB) | Vista Previa

Resumen

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.

Más información

ID de Registro: 37660
Identificador DC: http://oa.upm.es/37660/
Identificador OAI: oai:oa.upm.es:37660
URL Oficial: http://2015.qcrypt.net/scientific-program/
Depositado por: Memoria Investigacion
Depositado el: 13 May 2016 12:22
Ultima Modificación: 13 May 2016 12:22
  • Open Access
  • Open Access
  • Sherpa-Romeo
    Compruebe si la revista anglosajona en la que ha publicado un artículo permite también su publicación en abierto.
  • Dulcinea
    Compruebe si la revista española en la que ha publicado un artículo permite también su publicación en abierto.
  • Recolecta
  • e-ciencia
  • Observatorio I+D+i UPM
  • OpenCourseWare UPM