Finite-key analysis for the 1-decoy state QKD protocol

DOI PDF 1 Citations
  • Davide Rusca
    Group of Applied Physics, University of Geneva , Chemin de Pinchat 22, CH-1211 Geneva 4, Switzerland
  • Alberto Boaron
    Group of Applied Physics, University of Geneva , Chemin de Pinchat 22, CH-1211 Geneva 4, Switzerland
  • Fadri Grünenfelder
    Group of Applied Physics, University of Geneva , Chemin de Pinchat 22, CH-1211 Geneva 4, Switzerland
  • Anthony Martin
    Group of Applied Physics, University of Geneva , Chemin de Pinchat 22, CH-1211 Geneva 4, Switzerland
  • Hugo Zbinden
    Group of Applied Physics, University of Geneva , Chemin de Pinchat 22, CH-1211 Geneva 4, Switzerland

Description

<jats:p>It has been shown that in the asymptotic case of infinite-key length, the 2-decoy state Quantum Key Distribution (QKD) protocol outperforms the 1-decoy state protocol. Here, we present a finite-key analysis of the 1-decoy method. Interestingly, we find that for practical block sizes of up to 108 bits, the 1-decoy protocol achieves for almost all experimental settings higher secret key rates than the 2-decoy protocol. Since using only one decoy is also easier to implement, we conclude that it is the best choice for QKD, in most common practical scenarios.</jats:p>

Journal

Citations (1)*help

See more

Details 詳細情報について

Report a problem

Back to top