Performance Analysis and Optimization of the Winnow Secret Key Reconciliation Protocol

Abstract : Currently, private communications in public and government sectors rely on methods of cryptographic key distribution that will likely be rendered obsolete the moment a full-scale quantum computer is realized, or efficient classical methods of factoring are discovered. There are alternative methods for distributing secret key material in a "post-quantum" era. One example of a system capable of securely distributing cryptographic key material, known as Quantum Key Distribution (QKD), is secure against quantum factorization techniques as its security rests on generally accepted laws of quantum physics. QKD protocols typically include a phase called "Error Reconciliation", a clear-text classical-channel discussion between legitimate parties of a QKD protocol by which errors introduced in the quantum channel are corrected and the legitimate parties ensure they share identical key material. This work improves one such reconciliation protocol, called Winnow, by examining block-size choices for Winnow and thus increasing QKD key rate. Block sizes are chosen to maximize the probability that each block contains exactly one error. Further analyses of Winnow are provided to characterize the effects of different error distributions on protocol operation and shed light on the time and communication complexities of the Winnow secret key reconciliation protocol.

[1]  Anastase Nakassis,et al.  Expeditious reconciliation for practical quantum key distribution , 2004, SPIE Defense + Commercial Sensing.

[2]  Hong Guo,et al.  Efficiency of Winnow Protocol in Secret Key Reconciliation , 2009, 2009 WRI World Congress on Computer Science and Information Engineering.

[3]  Gilles Brassard,et al.  Secret-Key Reconciliation by Public Discussion , 1994, EUROCRYPT.

[4]  Gilles Brassard,et al.  Experimental Quantum Cryptography , 1990, EUROCRYPT.

[5]  Horace P. Yuen,et al.  Problems of the CASCADE Protocol and Renyi Entropy Reduction in Classical and Quantum Key Generation , 2007 .

[6]  Mario Pivk,et al.  Applied Quantum Cryptography , 2010 .

[7]  C. G. Peterson,et al.  Fast, efficient error reconciliation for quantum cryptography , 2002, quant-ph/0203096.

[8]  T. Sugimoto,et al.  A Study on Secret key Reconciliation Protocol "Cascade" , 2000 .

[9]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[10]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[11]  Larry Carter,et al.  New Hash Functions and Their Use in Authentication and Set Equality , 1981, J. Comput. Syst. Sci..

[12]  Kevin T. Phelps,et al.  Coding Theory and Cryptography : The Essentials , 2022 .

[13]  Feng Zhao,et al.  Error reconciliation for practical quantum cryptography , 2007 .

[14]  Gilles Brassard,et al.  Quantum cryptography: Public key distribution and coin tossing , 2014, Theor. Comput. Sci..

[15]  Stephen Wiesner,et al.  Conjugate coding , 1983, SIGA.

[16]  Gilles Van Assche,et al.  Quantum cryptography and secret-key distillation , 2006 .