Efficient bit sifting scheme of post-processing in quantum key distribution
From MaRDI portal
Publication:892640
DOI10.1007/S11128-015-1035-8zbMATH Open1327.81162arXiv1409.7582OpenAlexW976100934MaRDI QIDQ892640FDOQ892640
Authors: Qiong Li, Dan Le, Xianyan Wu, Hong Guo, Xia-Mu Niu
Publication date: 11 November 2015
Published in: Quantum Information Processing (Search for Journal in Brave)
Abstract: Bit sifting is an important step in the post-processing of Quantum Key Distribution (QKD) whose 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, and it is facing unprecedented challenges with the fast increase of the repetition frequency of quantum channel. In this paper, we present an efficient bit sifting scheme whose core is a lossless source coding algorithm. Both theoretical analysis and experimental results demonstrate that the performance of our scheme is approaching the Shannon limit. Our scheme can greatly decrease the communication traffic of the post-processing of a QKD system, which means it can decrease the secure key consumption for classical channel authentication and increase the net secure key rate of the QKD system. Meanwhile, it can relieve the storage pressure of the system greatly, especially the device at Alice side. Some recommendations on the application of our scheme to some representative practical QKD systems are also provided.
Full work available at URL: https://arxiv.org/abs/1409.7582
Recommendations
- Sifting attacks in finite-size quantum key distribution
- Efficient quantum key distribution scheme and a proof of its unconditional security
- Post-processing optimization for continuous-variable quantum key distribution
- Polar codes-based one-step post-processing of quantum key distribution
- scientific article
post-processingquantum cryptographyquantum key distributionsource codingbit siftingnet secure key rateunconditionally secure authentication
Cites Work
- Elements of Information Theory
- A Mathematical Theory of Communication
- New hash functions and their use in authentication and set equality
- Universal classes of hash functions
- New Universal Hash Functions
- Unconditional security in quantum cryptography
- Applied quantum cryptography
- Universal hashing and authentication codes
- Quantum key distribution and string oblivious transfer in noisy channels
- Title not available (Why is that?)
- Blind Reconciliation
Cited In (2)
This page was built for publication: Efficient bit sifting scheme of post-processing in quantum key distribution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q892640)