An efficient hybrid hash based privacy amplification algorithm for quantum key distribution

Yan, Bingze; Li, Qiong; Mao, Haokun; Chen, Nan

doi:10.1007/s11128-022-03462-4

Cited by 7 publications

(3 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Because of the finite-size effects, the block length in the procedure of privacy amplification is at least

, which also takes up abundant hardware resource [ 26 , 27 ], so that not all the check matrices can be stored in advance. The reconciliation efficiency will be reduced quickly even if the SNR changes in a very small range.…”

Section: Simulation Experimentsmentioning

confidence: 99%

Rate-Compatible LDPC Codes for Continuous-Variable Quantum Key Distribution in Wide Range of SNRs Regime

Fan

Niu

Zhao

et al. 2022

Entropy

View full text Add to dashboard Cite

Long block length rate-compatible low-density parity-compatible (LDPC) codes are designed to solve the problems of great variation of quantum channel noise and extremely low signal-to-noise ratio in continuous-variable quantum key distribution (CV-QKD). The existing rate-compatible methods for CV-QKD inevitably cost abundant hardware resources and waste secret key resources. In this paper, we propose a design rule of rate-compatible LDPC codes that can cover all potential SNRs with single check matrix. Based on this long block length LDPC code, we achieve high efficiency continuous-variable quantum key distribution information reconciliation with a reconciliation efficiency of 91.80% and we have higher hardware processing efficiency and lower frame error rate than other schemes. Our proposed LDPC code can obtain a high practical secret key rate and a long transmission distance in an extremely unstable channel.

show abstract

“…Because of the finite-size effects, the block length in the procedure of privacy amplification is at least

Section: Simulation Experimentsmentioning

confidence: 99%

Rate-Compatible LDPC Codes for Continuous-Variable Quantum Key Distribution in Wide Range of SNRs Regime

Fan

Niu

Zhao

et al. 2022

Entropy

View full text Add to dashboard Cite

show abstract

“…In the quantum transmission, Bob randomly measures quantum states with a homodyne or a heterodyne detector [13]. Post-processing is to extract secret keys from both parties, which consists of four main steps: data sifting [10,11], parameter estimation [3,14], information reconciliation (IR) [15,16], and privacy amplification [17][18][19]. It is reported that IR is essential in the post-processing to improve the secret key rate (SKR) [20].…”

Section: Introductionmentioning

confidence: 99%

Low-complexity adaptive reconciliation protocol for continuous-variable quantum key distribution

Jiang,

Xue,

Tang

et al. 2024

Quantum Sci. Technol.

View full text Add to dashboard Cite

In continuous-variable quantum key distribution systems, reconciliation is a crucial step that significantly affects the secret key rate (SKR). The rateless protocol based on Raptor codes can achieve high reconciliation efficiency at low signal-to-noise ratios (SNRs). However, the high complexity of low-density parity-check (LDPC) codes used for the precoding in Raptor codes limits the speed of reconciliation. In this paper, we propose an adaptive reconciliation protocol by modifying Raptor codes. The length of random binary sequences is increased because we remove the LDPC precoding that adds redundancy. The modified Raptor codes reduce the complexity of encoding with better performance. The proposed protocol can achieve a reconciliation efficiency of 98.1% and reach a SKR higher than 2.5×10^3 bit/s at a SNR of -20dB, higher than previous protocols.

show abstract

“…Therefore, quantum cryptography has absolute security in theory. Since the first quantum cryptographic protocol [1] appeared in 1984, many different kinds of quantum cryptographic protocols have been proposed one after another, such as quantum key distribution (QKD) [2][3][4][5] , quantum secret sharing (QSS), [6][7][8][9][10] quantum secure direct communication (QSDC), [11][12][13][14] quantum privacy comparison (QPC), [15][16][17][18] quantum key agreement (QKA), [19][20][21][22][23][24][25][26] etc.…”

Section: Introductionmentioning

confidence: 99%

Improved quantum key agreement protocol with authentication

Guo¹,

Bai²,

Xin³

et al. 2023

Chinese Phys. B

View full text Add to dashboard Cite

In order to make the quantum key agreement process immune to participant attacks, it is necessary to introduce the authentication in the communication process. A quantum key agreement protocol with identity authentication that exploit the measurement correlation of six-particle entangled states is proposed. In contrast to some recently proposed quantum key agreement protocols with authentication, this protocol requires neither a semi-trusted third party nor additional private keys in the authentication process. The entire process of authentication and key agreement can be achieved using only n six-particle entangled states, which saves communication costs and reduces the complexity of the authentication process. Finally, security analysis shows that this scheme is resistant to some important attacks.

show abstract

An efficient hybrid hash based privacy amplification algorithm for quantum key distribution

Cited by 7 publications

References 12 publications

Rate-Compatible LDPC Codes for Continuous-Variable Quantum Key Distribution in Wide Range of SNRs Regime

Rate-Compatible LDPC Codes for Continuous-Variable Quantum Key Distribution in Wide Range of SNRs Regime

Low-complexity adaptive reconciliation protocol for continuous-variable quantum key distribution

Improved quantum key agreement protocol with authentication

Contact Info

Product

Resources

About