This paper demonstrates ways to improve the post-processing phase of BB84-based Quantum Key Distribution (QKD) while maintaining Information-Theoretic security. Maximum entropy in the distilled bits can be achieved provided that we follow certain rules on which bits are sacrificed based on the properties of the generator matrix. We use standard decoder techniques to distill bits and establish Information-Theoretic security and provide insights into how those techniques can be adapted to provide greater bit throughput. Finally, we compare popular coding schemes in BB84 post-processing as a basis for code selection and discover at low initial Bit Error Rates (BER), a Polar 4/5 or Hamming* give the best performance and for higher initial BER, the LDPC 3/4 and Hamming* (a modified Hamming code) give the best performance [1] [2] [9] [10].
This paper demonstrates ways to improve the post-processing phase of BB84-based Quantum Key Distribution (QKD) while maintaining Information-Theoretic security. Maximum entropy in the distilled bits can be achieved provided that we follow certain rules on which bits are sacrificed based on the properties of the generator matrix. We use standard decoder techniques to distill bits and establish Information-Theoretic security and provide insights into how those techniques can be adapted to provide greater bit throughput. Finally, we compare popular coding schemes in BB84 post-processing as a basis for code selection and discover at low initial Bit Error Rates (BER), a Polar 4/5 or Hamming* give the best performance and for higher initial BER, the LDPC 3/4 and Hamming* (a modified Hamming code) give the best performance [1] [2] [9] [10].
Post-processing in BB84-based Quantum Key Distribution (QKD) must simultaneously ensure error correction, preserve secrecy, and satisfy strict resource constraints on embedded or edge devices. These competing requirements make the choice of coding strategy a system-level co-design problem involving both communication performance and decoder implementation cost. In this work, we present a comparative co-design framework that selects among LDPC, Polar, BCH, and Hamming codes based on real-time estimates of the quantum bit error rate (QBER), desired burn rate, and available decoding resources. We evaluate coding on the quantum channel and on the classical side-channel, quantifying their impact on residual BER, entropy loss, computational complexity, and secret-key rate. The resulting operational boundaries identify which codes are optimal in low-, moderate-, and high-error regimes. These boundaries provide a practical approach for implementing efficient BB84 reconciliation in embedded and edge QKD systems.
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.
Quantum key distribution (QKD) is a method that enables secure communication between two parties by applying the ideas of quantum physics. By minimizing information leakage that can happen during the key generation process, privacy amplification is a technique used to improve the security of QKD. The technique involves processing the raw key obtained from QKD through a randomization procedure to remove any residual information that may have been leaked during the quantum transmission. While privacy amplification can significantly improve the security of QKD, the effectiveness of the technique is limited by the quality of the initial raw key. The BB84 QKD protocol has been improved with the proposed En-BB84 protocol, which includes built-in authentication and integrity checks. The En-BB84 protocol ensures secure distribution of secret keys and protects against tampering by attackers. Key distillation and error correction techniques are employed to extract a shorter, more secure shared secret key and correct errors introduced during qubit transmission. The protocol utilizes a four-state QKD approach, expanding on the traditional two-state scheme of BB84. A simulation of the En-BB84 protocol is demonstrated using a quantum circuit implemented with Qiskit in Python. The circuit employs various gates and operations, including Hadamard, CX, controlled swap, and RZ gates, to achieve encoding and error correction. Furthermore, we have designed a better protocol with improved error rates by incorporating improvisations on the BB84 protocol. Experimental results indicate the successful integration of the B92 error correction scheme into the modified BB84 protocol, enhancing the security and performance of QKD systems.
We study achievable secret key rates for the Bennett-Brassard-84 (BB84) quantum key distribution protocol with one way classical post-processing. Specifically, we characterize the performance of a family of error correcting codes when used in the information reconciliation phase of BB84. When combined with noisy processing, these codes allow secure key to be established for quantum bit error rates up to 0.129. This improvement over the previous best noise threshold of 0.124 illustrates, in contrast to the classical scenario, a marked advantage of structured codes over random codes when used for quantum key distribution. Our results are intimately connected to degenerate quantum codes, which we briefly discuss.
Key distillation, also referred to as classical post-processing, plays a pivotal role in Quantum Key Distribution (QKD) protocols. Key distillation encompasses numerous subroutines, making the analysis of its overall security implications potentially challenging for those outside the research community. In this paper, we elucidate the role of the key distillation phase in QKD from a security standpoint. We begin by analyzing the different components of the key distillation phase individually, followed by an examination of the process as a whole. We then calculate the bit strength of the produced key, assuming that an attacker is executing an intercept and resend attack. For our analysis, we employ a practical key distillation implementation linked to a decoy state BB84 protocol as a case study. Our findings suggest that the security of the final key, post the key distillation phase, hinges on several factors. These include the theoretical security of the implemented subroutines, the total information leakage throughout the process, and the choices of subroutine parameters. Given these assumptions, we can distill 287 secure bits for every 1000 bits that undergo the key distillation procedure.
Quantum Key Distribution (QKD) allows two legitimate parties, Alice and Bob, to share a secret key with information-theoretic security, ensuring that an eavesdropper, Eve, cannot obtain any information about the key. A QKD protocol is provably secure only when the Quantum Bit Error Rate (QBER) is below a certain threshold and, therefore, the presence of noise inherently limits the maximum transmission distance. Advantage Distillation (AD) is a classical post-processing technique that enhances QKD protocols by increasing the maximum acceptable QBER and, thus, allows extending the communication range. AD operates by post-selecting blocks of bits and extracting fewer but highly correlated bits between Alice and Bob, which exhibit a reduced QBER, thus lowering the amount of information that has to be disclosed during the information reconciliation step. In this study, we present a new analytical expression for the secure key rate. This will enable a finite-size secure key length analysis of the decoy state version of the BB84 protocol including AD post-processing.