Efficient bit sifting scheme of post-processing in quantum key distribution

Bit sifting is an important step in the post-processing of quantum key distribution (QKD). Its function is to sift out the undetected original keys. The communication traffic of bit sifting has essential impact on the net secure key rate of a practical QKD system. In this paper, an efficient bit sifting scheme is presented, of which the core is a lossless source coding algorithm. Both theoretical analysis and experimental results demonstrate that the performance of the scheme is approaching the Shannon limit. The proposed scheme can greatly decrease the communication traffic of the post-processing of a QKD system, which means the proposed scheme can decrease the secure key consumption for classical channel authentication and increase the net secure key rate of the QKD system, as demonstrated by analyzing the improvement on the net secure key rate. Meanwhile, some recommendations on the application of the proposed scheme to some representative practical QKD systems are also provided.

[1]  Dominic Mayers,et al.  Unconditional security in quantum cryptography , 1998, JACM.

[2]  W. Marsden.  I and J , 2012 .

[3]  Lei Zhou,et al.  A Real-Time QKD System Based on FPGA , 2012, Journal of Lightwave Technology.

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

[5]  Ahmad-Reza Sadeghi,et al.  Research in Cryptology, Second Western European Workshop, WEWoRC 2007, Bochum, Germany, July 4-6, 2007, Revised Selected Papers , 2008, WEWoRC.

[6]  Sébastien Kunz-Jacques,et al.  High performance error correction for quantum key distribution using polar codes , 2014, Quantum Inf. Comput..

[7]  Douglas R. Stinson,et al.  Universal hashing and authentication codes , 1991, Des. Codes Cryptogr..

[8]  Bert den Boer.  A Simple and Key-Economical Unconditional Authentication Scheme , 1993, J. Comput. Secur..

[9]  O. Sangaroon,et al.  Secret key reconciliation using BCH code in quantum key distribution , 2007, 2007 International Symposium on Communications and Information Technologies.

[10]  Christopher Portmann,et al.  Key Recycling in Authentication , 2012, IEEE Transactions on Information Theory.

[11]  Won-Young Hwang.  Quantum key distribution with high loss: toward global secure communication. , 2003, Physical review letters.

[12]  Alan Mink.  Custom hardware to eliminate bottlenecks in QKD throughput performance , 2007, SPIE Optics East.

[13]  N. Gisin,et al.  High rate, long-distance quantum key distribution over 250 km of ultra low loss fibres , 2009, 0903.3907.

[14]  Aysajan Abidin,et al.  New Universal Hash Functions , 2011, WEWoRC.

[15]  Richard Johnsonbaugh,et al.  Foundations of mathematical analysis , 1981 .

[16]  Pascal Junod,et al.  A fast and versatile quantum key distribution system with hardware key distillation and wavelength multiplexing , 2013, 1309.2583.

[17]  Thomas Johansson,et al.  On Families of Hash Functions via Geometric Codes and Concatenation , 1993, CRYPTO.

[18]  Yehuda Lindell,et al.  More Efficient Constant-Round Multi-Party Computation from BMR and SHE , 2016, IACR Cryptol. ePrint Arch..

[19]  Wei Chen,et al.  2 GHz clock quantum key distribution over 260 km of standard telecom fiber. , 2012, Optics letters.

[20]  Qiong Li,et al.  A Design and Implementation of Multi-thread Quantum Key Distribution Post-processing Software , 2012, 2012 Second International Conference on Instrumentation, Measurement, Computer, Communication and Control.

[21]  Hugo Krawczyk,et al.  LFSR-based Hashing and Authentication , 1994, CRYPTO.

[22]  Larry Carter,et al.  Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..

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

[24]  Debbie W. Leung,et al.  The Universal Composable Security of Quantum Key Distribution , 2004, TCC.

[25]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[26]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[27]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[28]  A R Dixon,et al.  Field test of quantum key distribution in the Tokyo QKD Network. , 2011, Optics express.

[29]  Hong Guo,et al.  An Implementation of Post-Processing Software in Quantum Key Distribution , 2009, 2009 WRI World Congress on Computer Science and Information Engineering.

[30]  Thomas M. Cover,et al.  Elements of information theory (2. ed.) , 2006 .

[31]  V. Scarani,et al.  Fast and simple one-way quantum key distribution , 2005, quant-ph/0506097.

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

[33]  J. Dynes,et al.  Gigahertz decoy quantum key distribution with 1 Mbit/s secure key rate. , 2008, Optics express.

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

[35]  A. Tajima,et al.  High-Speed Quantum Key Distribution System for 1-Mbps Real-Time Key Generation , 2012, IEEE Journal of Quantum Electronics.

[36]  Dominic Mayers,et al.  Quantum Key Distribution and String Oblivious Transfer in Noisy Channels , 1996, CRYPTO.

[37]  N. Lütkenhaus.  Security against individual attacks for realistic quantum key distribution , 2000 .

[38]  A R Dixon,et al.  Continuous operation of high bit rate quantum key distribution , 2010, 1005.4573.

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

[40]  David Elkouss,et al.  Blind reconciliation , 2012, Quantum Inf. Comput..