arXiv subjects

Bing-Ze Yan

Publications and source records attributed to Bing-Ze Yan.

3 recordsLinked to original sources

arXiv2025

Improving key rates by tighter information reconciliation leakage estimation for quantum key distribution

Previous research has aimed to precisely estimate information leakage to improve the secure key rate (SKR) and maximum transmission distance in quantum key distribution (QKD). However, existing methods repeatedly considerd the information of the multi-photon pulses known to Eve before and after information reconciliation, resulting in an overestimation of the leakage amount. We propose a novel approach that considers the quantum part's effect on post-processing, providing a more accurate estimation of information reconciliation leakage to improve the SKR. Theoretical analysis shows that our method more accurately estimates the information reconciliation leakage, significantly improving the SKR at any distance as well as the maximum transmission distance. It is worth mentioning that previous studies treat information leakage of the error correction as Shannon bound $Nh(e)$, and our method can estimate it more tightly. Simulation results for decoy-BB84 and measurement-device-independent (MDI) protocols using Cascade are consistent with the theoretical analysis. The farther the transmission distance, the greater the growth rate of SKR. When the error rate is 33%, compared with the original method, the SKR growth rate of decoy-BB84 at 100KM is 100.4%, and the transmission distance of MDI increases by 22KM.

quant-ph↗

arXiv2021

A novel approach to reducing information leakage for quantum key distribution

Quantum key distribution (QKD) is an important branch of quantum information science as it holds promise for unconditionally secure communication. For QKD research, a central issue is to improve the final secure key rate (SKR) and the maximal transmission distance. To address this issue, most works focused on reducing the information leakage of QKD. In this paper, we propose a novel approach to further reduce the information leakage by specially considering the overlap between the information leakage of quantum part and post-processing part. The overlap means that the information leakage of post-processing part caused solely by multi-photon pulses is considered twice in previous studies, i.e., both in quantum part and post-processing part. Since the information carried by multi-photon pulses has been considered as completely known by Eve through the photon-number-splitting attack in quantum part, there is no need to consider it in post-processing part repetitively during the SKR calculation. Therefore, our approach can theoretically reduce the information leakage of a QKD protocol. Based on this idea, we derive the formulas to calculate the amount of information leakage for decoy-BB84 and sending-or-not-sending twin-field protocols. Simulation results for these two typical protocols also demonstrate that our approach evidently improves the SKR as well as the maximal transmission distance under practical experimental parameters.

quant-ph↗

arXiv2018

High-speed Implementation of FFT-based Privacy Amplification on FPGA in Quantum Key Distribution

Privacy amplification (PA) is a vital procedure in quantum key distribution (QKD) to generate the secret key that the eavesdropper has only negligible information from the identical correcting key for the communicating parties. With the increase of repeat frequency of discrete-variable QKD (DV-QKD) system, the processing speed of PA has become the bottle neck restricting DV-QKD's secure key rate. The PA using Toeplitz-based Hash function is adopted widely because of its simplicity and parallel feature. Because this algorithm can be accelerated with Fast Fourier Transform (FFT), an improved scheme PA for Field-programmable Gate Array (FPGA) based on this is proposed. This paper improves the custom FFT-based algorithm by reducing the number of computations and read/write memory operations significantly. The correctness is verified when implemented in a Xilinx Virtex-6 FPGA. Meanwhile, the processing speed of improved scheme can nearly double the classical Toeplitz Hashing scheme on FPGA through the actual experiment.

quant-ph↗