1
|
Borisov N, Petrov I, Tayduganov A. Asymmetric Adaptive LDPC-Based Information Reconciliation for Industrial Quantum Key Distribution. ENTROPY (BASEL, SWITZERLAND) 2022; 25:31. [PMID: 36673171 PMCID: PMC9857619 DOI: 10.3390/e25010031] [Citation(s) in RCA: 2] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Figures] [Subscribe] [Scholar Register] [Received: 11/24/2022] [Revised: 12/10/2022] [Accepted: 12/19/2022] [Indexed: 06/17/2023]
Abstract
We develop a new approach for asymmetric LDPC-based information reconciliation in order to adapt to the current channel state and achieve better performance and scalability in practical resource-constrained QKD systems. The new scheme combines the advantages of LDPC codes, a priori error rate estimation, rate-adaptive and blind information reconciliation techniques. We compare the performance of several asymmetric and symmetric error correction schemes using a real industrial QKD setup. The proposed asymmetric algorithm achieves significantly higher throughput, providing a secret key rate that is close to the symmetric one in a wide range of error rates. Thus, our approach is found to be particularly efficient for applications with high key rates, limited classical channel capacity and asymmetric computational resource allocation.
Collapse
|
2
|
Mao HK, Qiao YC, Li Q. High-Efficient Syndrome-Based LDPC Reconciliation for Quantum Key Distribution. ENTROPY 2021; 23:e23111440. [PMID: 34828138 PMCID: PMC8620885 DOI: 10.3390/e23111440] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 09/10/2021] [Revised: 10/23/2021] [Accepted: 10/29/2021] [Indexed: 11/16/2022]
Abstract
Quantum key distribution (QKD) is a promising technique to share unconditionally secure keys between remote parties. As an essential part of a practical QKD system, reconciliation is responsible for correcting the errors due to the quantum channel noise by exchanging information through a public classical channel. In the present work, we propose a novel syndrome-based low-density parity-check (LDPC) reconciliation protocol to reduce the information leakage of reconciliation by fully utilizing the syndrome information that was previously wasted. Both theoretical analysis and simulation results show that our protocol can evidently reduce the information leakage as well as the number of communication rounds.
Collapse
Affiliation(s)
- Hao-Kun Mao
- Department of Computer Science and Technology, Harbin Institute of Technology, Harbin 150080, China;
| | - Yu-Cheng Qiao
- Guangxi Key Lab Cryptography & Information Security, Guilin University of Electronic Technology, Guilin 541004, China;
| | - Qiong Li
- Department of Computer Science and Technology, Harbin Institute of Technology, Harbin 150080, China;
- Correspondence:
| |
Collapse
|
3
|
Gümüş K, Eriksson TA, Takeoka M, Fujiwara M, Sasaki M, Schmalen L, Alvarado A. A novel error correction protocol for continuous variable quantum key distribution. Sci Rep 2021; 11:10465. [PMID: 34001965 PMCID: PMC8128890 DOI: 10.1038/s41598-021-90055-3] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 11/13/2020] [Accepted: 04/26/2021] [Indexed: 11/29/2022] Open
Abstract
Reconciliation is a key element of continuous-variable quantum key distribution (CV-QKD) protocols, affecting both the complexity and performance of the entire system. During the reconciliation protocol, error correction is typically performed using low-density parity-check (LDPC) codes with a single decoding attempt. In this paper, we propose a modification to a conventional reconciliation protocol used in four-state protocol CV-QKD systems called the multiple decoding attempts (MDA) protocol. MDA uses multiple decoding attempts with LDPC codes, each attempt having fewer decoding iteration than the conventional protocol. Between each decoding attempt we propose to reveal information bits, which effectively lowers the code rate. MDA is shown to outperform the conventional protocol in regards to the secret key rate (SKR). A 10% decrease in frame error rate and an 8.5% increase in SKR are reported in this paper. A simple early termination for the LDPC decoder is also proposed and implemented. With early termination, MDA has decoding complexity similar to the conventional protocol while having an improved SKR.
Collapse
Affiliation(s)
- Kadir Gümüş
- Department of Electrical Engineering, Eindhoven University of Technology, Eindhoven, 5600MB, The Netherlands. .,Karlsruhe Institute of Technology, Communications Engineering Lab, 76131, Karlsruhe, Germany.
| | - Tobias A Eriksson
- National Institute of Information and Communications Technology (NICT), 4-2-1 Nukui-kitamachi, Koganei, Tokyo, 184-8795, Japan.,Infinera, Fredsborgsgatan 24, 117 43, Stockholm, Sweden
| | - Masahiro Takeoka
- National Institute of Information and Communications Technology (NICT), 4-2-1 Nukui-kitamachi, Koganei, Tokyo, 184-8795, Japan
| | - Mikio Fujiwara
- National Institute of Information and Communications Technology (NICT), 4-2-1 Nukui-kitamachi, Koganei, Tokyo, 184-8795, Japan
| | - Masahide Sasaki
- National Institute of Information and Communications Technology (NICT), 4-2-1 Nukui-kitamachi, Koganei, Tokyo, 184-8795, Japan
| | - Laurent Schmalen
- Karlsruhe Institute of Technology, Communications Engineering Lab, 76131, Karlsruhe, Germany
| | - Alex Alvarado
- Department of Electrical Engineering, Eindhoven University of Technology, Eindhoven, 5600MB, The Netherlands
| |
Collapse
|
4
|
Xie J, Wu H, Xia C, Ding P, Song H, Xu L, Chen X. High throughput error correction in information reconciliation for semiconductor superlattice secure key distribution. Sci Rep 2021; 11:3909. [PMID: 33594169 PMCID: PMC7886916 DOI: 10.1038/s41598-021-82684-5] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 10/28/2020] [Accepted: 01/21/2021] [Indexed: 11/22/2022] Open
Abstract
Semiconductor superlattice secure key distribution (SSL-SKD) has been experimentally demonstrated to be a novel scheme to generate and agree on the identical key in unconditional security just by public channel. The error correction in the information reconciliation procedure is introduced to eliminate the inevitable differences of analog systems in SSL-SKD. Nevertheless, the error correction has been proved to be the performance bottleneck of information reconciliation for high computational complexity. Hence, it determines the final secure key throughput of SSL-SKD. In this paper, different frequently-used error correction codes, including BCH codes, LDPC codes, and Polar codes, are optimized separately to raise the performance, making them usable in practice. Firstly, we perform multi-threading to support multi-codeword decoding for BCH codes and Polar codes and updated value calculation for LDPC codes. Additionally, we construct lookup tables to reduce redundant calculations, such as logarithmic table and antilogarithmic table for finite field computation. Our experimental results reveal that our proposed optimization methods can significantly promote the efficiency of SSL-SKD, and three error correction codes can reach the throughput of Mbps and provide a minimum secure key rate of 99%.
Collapse
Affiliation(s)
- Jianguo Xie
- Beijing Electronic Science and Technology Institute, Beijing, 100070, China
| | - Han Wu
- Key Laboratory of Nanodevices and Applications, Suzhou Institute of Nano-Tech and Nano-Bionics, Chinese Academy of Sciences (CAS), Suzhou, 215123, China
| | - Chao Xia
- Beijing Electronic Science and Technology Institute, Beijing, 100070, China
| | - Peng Ding
- Key Laboratory of Nanodevices and Applications, Suzhou Institute of Nano-Tech and Nano-Bionics, Chinese Academy of Sciences (CAS), Suzhou, 215123, China
| | - Helun Song
- Key Laboratory of Nanodevices and Applications, Suzhou Institute of Nano-Tech and Nano-Bionics, Chinese Academy of Sciences (CAS), Suzhou, 215123, China
| | - Liwei Xu
- Beijing Electronic Science and Technology Institute, Beijing, 100070, China
| | - Xiaoming Chen
- Beijing Electronic Science and Technology Institute, Beijing, 100070, China.
| |
Collapse
|
5
|
Wang X, Zhang Y, Yu S, Guo H. High speed error correction for continuous-variable quantum key distribution with multi-edge type LDPC code. Sci Rep 2018; 8:10543. [PMID: 30002473 PMCID: PMC6043537 DOI: 10.1038/s41598-018-28703-4] [Citation(s) in RCA: 39] [Impact Index Per Article: 6.5] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 01/10/2018] [Accepted: 06/28/2018] [Indexed: 11/09/2022] Open
Abstract
Error correction is a significant step in postprocessing of continuous-variable quantum key distribution system, which is used to make two distant legitimate parties share identical corrected keys. We propose an experiment demonstration of high speed error correction with multi-edge type low-density parity check (MET-LDPC) codes based on graphic processing unit (GPU). GPU supports to calculate the messages of MET-LDPC codes simultaneously and decode multiple codewords in parallel. We optimize the memory structure of parity check matrix and the belief propagation decoding algorithm to reduce computational complexity. Our results show that GPU-based decoding algorithm greatly improves the error correction speed. For the three typical code rate, i.e., 0.1, 0.05 and 0.02, when the block length is 106 and the iteration number are 100, 150 and 200, the average error correction speed can be respectively achieved to 30.39 Mbits/s (over three times faster than previous demonstrations), 21.23 Mbits/s and 16.41 Mbits/s with 64 codewords decoding in parallel, which supports high-speed real-time continuous-variable quantum key distribution system.
Collapse
Affiliation(s)
- Xiangyu Wang
- State Key Laboratory of Information Photonics and Optical Communications, Beijing University of Posts and Telecommunications, Beijing, 100876, China
| | - Yichen Zhang
- State Key Laboratory of Information Photonics and Optical Communications, Beijing University of Posts and Telecommunications, Beijing, 100876, China.
| | - Song Yu
- State Key Laboratory of Information Photonics and Optical Communications, Beijing University of Posts and Telecommunications, Beijing, 100876, China.
| | - Hong Guo
- State Key Laboratory of Advanced Optical Communication Systems and Networks, School of Electronics Engineering and Computer Science, Center for Quantum Information Technology, Center for Computational Science and Engineering, Peking University, Beijing, 100871, China
| |
Collapse
|
6
|
Cai H, Long CM, DeRose CT, Boynton N, Urayama J, Camacho R, Pomerene A, Starbuck AL, Trotter DC, Davids PS, Lentine AL. Silicon photonic transceiver circuit for high-speed polarization-based discrete variable quantum key distribution. OPTICS EXPRESS 2017; 25:12282-12294. [PMID: 28786586 DOI: 10.1364/oe.25.012282] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.1] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Received: 02/07/2017] [Accepted: 05/06/2017] [Indexed: 06/07/2023]
Abstract
We demonstrate a silicon photonic transceiver circuit for high-speed discrete variable quantum key distribution that employs a common structure for transmit and receive functions. The device is intended for use in polarization-based quantum cryptographic protocols, such as BB84. Our characterization indicates that the circuit can generate the four BB84 states (TE/TM/45°/135° linear polarizations) with >30 dB polarization extinction ratios and gigabit per second modulation speed, and is capable of decoding any polarization bases differing by 90° with high extinction ratios.
Collapse
|
7
|
Quantum key distribution with hacking countermeasures and long term field trial. Sci Rep 2017; 7:1978. [PMID: 28512308 PMCID: PMC5434053 DOI: 10.1038/s41598-017-01884-0] [Citation(s) in RCA: 22] [Impact Index Per Article: 3.1] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 12/12/2016] [Accepted: 04/04/2017] [Indexed: 11/11/2022] Open
Abstract
Quantum key distribution’s (QKD’s) central and unique claim is information theoretic security. However there is an increasing understanding that the security of a QKD system relies not only on theoretical security proofs, but also on how closely the physical system matches the theoretical models and prevents attacks due to discrepancies. These side channel or hacking attacks exploit physical devices which do not necessarily behave precisely as the theory expects. As such there is a need for QKD systems to be demonstrated to provide security both in the theoretical and physical implementation. We report here a QKD system designed with this goal in mind, providing a more resilient target against possible hacking attacks including Trojan horse, detector blinding, phase randomisation and photon number splitting attacks. The QKD system was installed into a 45 km link of a metropolitan telecom network for a 2.5 month period, during which time the system operated continuously and distributed 1.33 Tbits of secure key data with a stable secure key rate over 200 kbit/s. In addition security is demonstrated against coherent attacks that are more general than the collective class of attacks usually considered.
Collapse
|
8
|
Experimental realization of an entanglement access network and secure multi-party computation. Sci Rep 2016; 6:29453. [PMID: 27404561 PMCID: PMC4941518 DOI: 10.1038/srep29453] [Citation(s) in RCA: 17] [Impact Index Per Article: 2.1] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 03/15/2016] [Accepted: 06/17/2016] [Indexed: 11/29/2022] Open
Abstract
To construct a quantum network with many end users, it is critical to have a cost-efficient way to distribute entanglement over different network ends. We demonstrate an entanglement access network, where the expensive resource, the entangled photon source at the telecom wavelength and the core communication channel, is shared by many end users. Using this cost-efficient entanglement access network, we report experimental demonstration of a secure multiparty computation protocol, the privacy-preserving secure sum problem, based on the network quantum cryptography.
Collapse
|
9
|
Two Quantum Protocols for Oblivious Set-member Decision Problem. Sci Rep 2015; 5:15914. [PMID: 26514668 PMCID: PMC4626847 DOI: 10.1038/srep15914] [Citation(s) in RCA: 8] [Impact Index Per Article: 0.9] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 07/16/2015] [Accepted: 10/05/2015] [Indexed: 11/25/2022] Open
Abstract
In this paper, we defined a new secure multi-party computation problem, called Oblivious Set-member Decision problem, which allows one party to decide whether a secret of another party belongs to his private set in an oblivious manner. There are lots of important applications of Oblivious Set-member Decision problem in fields of the multi-party collaborative computation of protecting the privacy of the users, such as private set intersection and union, anonymous authentication, electronic voting and electronic auction. Furthermore, we presented two quantum protocols to solve the Oblivious Set-member Decision problem. Protocol I takes advantage of powerful quantum oracle operations so that it needs lower costs in both communication and computation complexity; while Protocol II takes photons as quantum resources and only performs simple single-particle projective measurements, thus it is more feasible with the present technology.
Collapse
|