• Corpus ID: 15047183

Problems of the CASCADE Protocol and Renyi Entropy Reduction in Classical and Quantum Key Generation

@article{Yamazaki2007ProblemsOT,
  title={Problems of the CASCADE Protocol and Renyi Entropy Reduction in Classical and Quantum Key Generation},
  author={Koichi Yamazaki and Ranjith Nair and Horace P. Yuen},
  journal={arXiv: Quantum Physics},
  year={2007}
}
It is shown that the interactive error correction protocol ‘CASCADE’ should be analyzed taking the correlation between passes and finite length of sequence into account. Furthermore we mention some problems in quantifying the reduction of Renyi entropy by information announced during the error correction process. 
View PDF on arXiv
4 Citations
Background Citations
1

Tables from this paper

4 Citations

Mathematical Modeling of Physical and Engineering Systems in Quantum Information

Several concrete examples in quantum information are discussed to demonstrate the importance of proper modeling that relates the mathematical description to real-world applications. In particular, it…

An efficient reconciliation in removing errors using Bose, Chaudhuri, Hocquenghem code for quantum key distribution

A simple Bose, Chaudhuri, Hocquenghem (BCH) error correction algorithm with simplified syndrome table is used to achieve an efficient reconciliation protocol which can handle a higher quantum bit error rate and outputs a common key with zero error probability.

Performance Analysis and Optimization of the Winnow Secret Key Reconciliation Protocol

Improved one such reconciliation protocol, called Winnow, is improved by examining block-size choices for Winnow and thus increasing QKD key rate and shed light on the time and communication complexities of the Winnow secret key reconciliation protocol.

Jurnal Teknologi An Efficient Reconciliation in Removing Errors Using Bose , Chaudhuri , Hocquenghem Code for Quantum Key Distribution

6 References

Advances in Cryptology — EUROCRYPT ’93

  • T. Helleseth
  • Computer Science
    Lecture Notes in Computer Science
  • 2001
An explicit relation between authentication codes and codes correcting independent errors is shown, which gives rise to several upper bounds on A-codes and how to construct A- codes starting from error correcting codes.

Journal of Cryptology

  • 10, pp. 97-110
  • 1997

New J. Phys

  • New J. Phys
  • 2003

J. of Cryptology

  • J. of Cryptology
  • 1992

IEEE, Trans. Inform. Theory

  • IEEE, Trans. Inform. Theory
  • 2001

IEEE

  • Trans. Inform. Theory, 47, pp. 2681-2695
  • 2001