Ideally, in any quantum key distribution (QKD) communication system, each sifted key is expected to be received without error. However in practice, due to infeasibility of generating pure single photon and device impairment problem, some of the sifted key may experience errors. This results to the increment of quantum bit error rate (QBER) that requires error reconciliation for correcting error. The main concept in error reconciliation is very much related to the capability of correcting all errors while minimizing eavesdrop information. The quantum error correcting code such as Hamming code which used in Winnow protocol is found to be more attractive. However the Winnow protocol can only correct one error out of seven bits. Adopting this classical error correcting code, an improved reconciliation scheme namely Siao Ping 1985 (SP 1985) protocol is proposed in this paper to correct more errors in faster pace without additional formulation for the overall simplicity criterion. This research is aimed at building up efficiency and effectiveness of reconciliation of the robust BB84 protocol in coping with noise interference. The proposed SP 1985 reconciliation protocol utilizes a pair of forward and reverse order syndromes for error pattern recognition. It is carried out in a simple structure which can correct up to double erroneous bits and detect four erroneous bits for each seven bits. Therefore, it is sufficient to deliver the desirable outcome after investigating its capability by correcting two errors out of seven bits compared to Winnow protocol. Its effectiveness can be measured based on simulation result which leads to reducing the QBER.
Ideally, in any quantum key distribution (QKD) communication system, each sifted key is expected to be received without error. However in practice, due to infeasibility of generating pure single photon and device impairment problem, some of the sifted key may experience errors. This results to the increment of quantum bit error rate (QBER) that requires error reconciliation for correcting error. The main concept in error reconciliation is very much related to the capability of correcting all errors while minimizing eavesdrop information. The quantum error correcting code such as Hamming code which used in Winnow protocol is found to be more attractive. However the Winnow protocol can only correct one error out of seven bits. Adopting this classical error correcting code, an improved reconciliation scheme namely Siao Ping 1985 (SP 1985) protocol is proposed in this paper to correct more errors in faster pace without additional formulation for the overall simplicity criterion. This research is aimed at building up efficiency and effectiveness of reconciliation of the robust BB84 protocol in coping with noise interference. The proposed SP 1985 reconciliation protocol utilizes a pair of forward and reverse order syndromes for error pattern recognition. It is carried out in a simple structure which can correct up to double erroneous bits and detect four erroneous bits for each seven bits. Therefore, it is sufficient to deliver the desirable outcome after investigating its capability by correcting two errors out of seven bits compared to Winnow protocol. Its effectiveness can be measured based on simulation result which leads to reducing the QBER.
Ideally, in any quantum key distribution (QKD) communication system, each sifted key is expected to be received without error. However in practice, due to infeasibility of generating pure single photon and device impairment problem, some of the sifted key may experience errors. This results to the increment of quantum bit error rate (QBER) that requires error reconciliation for correcting error. The main concept in error reconciliation is very much related to the capability of correcting all errors while minimizing eavesdrop information. The quantum error correcting code such as Hamming code which used in Winnow protocol is found to be more attractive. However the Winnow protocol can only correct one error out of seven bits. In this paper, a modified Hamming encoder/decoder to improve Winnow protocol by correcting two errors out of seven bits which leads to reducing the QBER is presented. This design utilizes a pair of forward and reverse order syndromes for error pattern recognition. A new reconciliation protocol has been developed to enhance the error correcting capability in BB84 protocol. It is carried out in a simple structure which can correct up to double erroneous bits and detect four erroneous bits for each seven bits.
In data post-processing for quantum key distribution, it is essential to have a highly efficient error reconciliation protocol. Based on the key redistribution scheme, we analyze a one-way error reconciliation protocol by data simulation. The relationship between the error correction capability and the key generation efficiency of three kinds of Hamming code are demonstrated. The simulation results indicate that when the initial error rates are(0,1.5%],(1.5,4%], and(4,11%], using the Hamming(31,26),(15,11), and(7,4) codes to correct the error, respectively, the key generation rate will be maximized. Based on this, we propose a modified one-way error reconciliation protocol which employs a mixed Hamming code concatenation scheme. The error correction capability and key generation rate are verified through data simulation. Using the parameters of the posterior distribution based on the tested data, a simple method for estimating the bit error rate(BER) with a given confidence interval is estimated. The simulation results show that when the initial bit error rate is 10.00%, after 7 rounds of error correction, the error bits are eliminated completely, and the key generation rate is 10.36%; the BER expectation is 2.96×10-10, and when the confidence is 95% the corresponding BER upper limit is 2.17×10-9. By comparison, for the single(7,4) Hamming code error reconciliation scheme at a confidence of 95%,the key generation rate is only 6.09%, while the BER expectation is 5.92×10-9, with a BER upper limit of 4.34×10-8. Hence, our improved protocol is much better than the original one.
In data post-processing for quantum key distribution, it is essential to have a highly efficient error reconciliation protocol. Based on the key redistribution scheme, we analyze a one-way error reconciliation protocol by data simulation. The relationship between the error correction capability and the key generation efficiency of three kinds of Hamming code are demonstrated. The simulation results indicate that when the initial error rates are(0,1.5%],(1.5,4%], and(4,11%], using the Hamming(31,26),(15,11), and(7,4) codes to correct the error, respectively, the key generation rate will be maximized. Based on this, we propose a modified one-way error reconciliation protocol which employs a mixed Hamming code concatenation scheme. The error correction capability and key generation rate are verified through data simulation. Using the parameters of the posterior distribution based on the tested data, a simple method for estimating the bit error rate(BER) with a given confidence interval is estimated. The simulation results show that when the initial bit error rate is 10.00%, after 7 rounds of error correction, the error bits are eliminated completely, and the key generation rate is 10.36%; the BER expectation is 2.96×10-10, and when the confidence is 95% the corresponding BER upper limit is 2.17×10-9. By comparison, for the single(7,4) Hamming code error reconciliation scheme at a confidence of 95%,the key generation rate is only 6.09%, while the BER expectation is 5.92×10-9, with a BER upper limit of 4.34×10-8. Hence, our improved protocol is much better than the original one.
In this paper, we propose how to construct a reconciliation method for the BB84 Quantum Key Distribution (QKD) protocol. Theoretically, it is unconditionally secure because it is based on the quantum laws of physics, rather than the assumed computational complexity of mathematical problems. BB84 protocol performances can be reduced by various errors and information leakages such as limited intrinsic efficiency of the protocol, imperfect devices and eavesdropping. The proposed reconciliation method allowed to weed out these errors by using Turbo codes. Since their high error correction capability implies getting low errors, this method has high performance especially when compared to the last method presented in the literature based on Low- Density Parity Check codes (LDPC). In particular, we demonstrate that our method leads to a significant improvement of the protocol security and of the Bit Error Rate (BER) even with great eavesdropping capability.
In data post-processing for quantum key distribution, it is essential to have a highly efficient error reconciliation protocol. Based on the key redistribution scheme, we analyze a one-way error reconciliation protocol by data simulation. The relationship between the error correction capability and the key generation efficiency of three kinds of Hamming code are demonstrated. The simulation results indicate that when the initial error rates are (0,1.5%], (1.5,4%], and (4,11%], using the Hamming (31,26), (15,11), and (7,4) codes to correct the error, respectively, the key generation rate will be maximized. Based on this, we propose a modified one-way error reconciliation protocol which employs a mixed Hamming code concatenation scheme. The error correction capability and key generation rate are verified through data simulation. Using the parameters of the posterior distribution based on the tested data, a simple method for estimating the bit error rate (BER) with a given confidence interval is estimated. The simulation results show that when the initial bit error rate is 10.00%, after 7 rounds of error correction, the error bits are eliminated completely, and the key generation rate is 10.36%; the BER expectation is 2.96 × 10-10, and when the confidence is 95% the corresponding BER upper limit is 2.17 × 10-9. By comparison, for the single (7,4) Hamming code error reconciliation scheme at a confidence of 95%, the key generation rate is only 6.09%, while the BER expectation is 5.92 × 10-9, with a BER upper limit of 4.34 × 10-8. Hence, our improved protocol is much better than the original one.
In this paper, we propose how to construct a reconciliation method for the BB84 Quantum Key Distribution (QKD) protocol. Theoretically, it is unconditionally secure because it is based on the quantum laws of physics, rather than the assumed computational complexity of mathematical problems. BB84 protocol performances can be reduced by various errors and information leakages such as limited intrinsic efficiency of the protocol, imperfect devices and eavesdropping. The proposed reconciliation method allowed to weed out these errors by using Turbo codes. Since their high error correction capability implies getting low errors, this method has high performance especially when compared to the last method presented in the literature based on Low-Density Parity Check codes (LDPC). In particular, we demonstrate that our method leads to a significant improvement of the protocol security and of the Bit Error Rate (BER) even with great eavesdropping capability.