Document Type
Conference Proceeding
Publication Date
10-12-2011
Abstract
Modern cryptography provides the means to securely communicate data between authorized entities by using mathematical transformations which require pre-shared cryptographic keys. The need to share key material with authorized entities in a secure, cost efficient and timely manner has driven efforts to develop new key distribution methods. A promising method is Quantum Key Distribution (QKD) which is considered to be “unconditionally secure” because it relies upon the immutable laws of quantum physics rather than computational complexity as the basis for its security. An important component of any QKD system is the error reconciliation protocol which is used to identify and correct inconsistencies in the exchanged key material and to identify potential eavesdroppers. In this research, we provide an empirical analysis of the Cascade error reconciliation protocol to measure its efficacy under different error rates, sampling rates, error distributions and larger sifted key sizes. The key finding presented in this research is that an error sampling rate of 25% provides optimal Cascade performance when using variable block sizes.
Source Publication
CSIIRW '11: Proceedings of the Seventh Annual Workshop on Cyber Security and Information Intelligence Research
Recommended Citation
Calver, T. I., Grimaila, M. R., & Humphries, J. W. (2011, October 12). An empirical analysis of the cascade error reconciliation protocol for quantum key distribution. 7th Annual Cyber Security and Information Intelligence Research Workshop: Energy Infrastructure Cyber Protection, CSIIRW11. Article # 58. https://doi.org/10.1145/2179298.2179363
Comments
Copyright © 2011 ACM. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee.
The "Link to Full Text" on this page opens or downloads the full article as hosted at the ACM website.