We consider in this paper the practical implementation of a siftingless quantum key distribution protocol. The protocol is considered siftingless since it combines sifting and error correction in a single step for basis and information reconciliation, respectively. The protocol can be efficiently implemented even assuming the existence of errors in the communication. In this case, the correlations between the legitimate parties can be modeled by a binary symmetric channel with erasures. Specific codes for this channel are included and simulated for intermediate block lengths. Simulation results show that a key reconciliation step carrying simultaneously both basis and information reconciliation can be efficiently implemented.
We consider in this paper the practical implementation of a siftingless quantum key distribution protocol. The protocol is considered siftingless since it combines sifting and error correction in a single step for basis and information reconciliation, respectively. The protocol can be efficiently implemented even assuming the existence of errors in the communication. In this case, the correlations between the legitimate parties can be modeled by a binary symmetric channel with erasures. Specific codes for this channel are included and simulated for intermediate block lengths. Simulation results show that a key reconciliation step carrying simultaneously both basis and information reconciliation can be efficiently implemented.
Quantum key distribution (QKD) relies on quantum and classical procedures in order to achieve the growing of a secret random string -the key- known only to the two parties executing the protocol. Limited intrinsic efficiency of the protocol, imperfect devices and eavesdropping produce errors and information leakage from which the set of measured signals -the raw key- must be stripped in order to distill a final, information theoretically secure, key. The key distillation process is a classical one in which basis reconciliation, error correction and privacy amplification protocols are applied to the raw key. This cleaning process is known as information reconciliation and must be done in a fast and efficient way to avoid cramping the performance of the QKD system. Brassard and Salvail proposed a very simple and elegant protocol to reconcile keys in the secret-key agreement context, known as Cascade, that has become the de-facto standard for all QKD practical implementations. However, it is highly interactive, requiring many communications between the legitimate parties and its efficiency is not optimal, imposing an early limit to the maximum tolerable error rate. In this paper we describe a low-density parity-check reconciliation protocol that improves significantly on these problems. The protocol exhibits better efficiency and limits the number of uses of the communications channel. It is also able to adapt to different error rates while remaining efficient, thus reaching longer distances or higher secure key rate for a given QKD system.
Quantum key distribution (QKD) relies on quantum and classical procedures in order to achieve the growing of a secret random string -the key- known only to the two parties executing the protocol. Limited intrinsic efficiency of the protocol, imperfect devices and eavesdropping produce errors and information leakage from which the set of measured signals -the raw key- must be stripped in order to distill a final, information theoretically secure, key. The key distillation process is a classical one in which basis reconciliation, error correction and privacy amplification protocols are applied to the raw key. This cleaning process is known as information reconciliation and must be done in a fast and efficient way to avoid cramping the performance of the QKD system. Brassard and Salvail proposed a very simple and elegant protocol to reconcile keys in the secret-key agreement context, known as Cascade, that has become the de-facto standard for all QKD practical implementations. However, it is highly interactive, requiring many communications between the legitimate parties and its efficiency is not optimal, imposing an early limit to the maximum tolerable error rate. In this paper we describe a low-density parity-check reconciliation protocol that improves significantly on these problems. The protocol exhibits better efficiency and limits the number of uses of the communications channel. It is also able to adapt to different error rates while remaining efficient, thus reaching longer distances or higher secure key rate for a given QKD system.
In traditional quantum key distribution protocol, both communication parties need to reconciliate their encoding basis to realize sharing secret keys. However, the process of basis reconciliation decreases the generation efficiency of the secret key and classical information is needed to be transmitted for every raw key. Based on quantum interference, we propose a high-efficiency quantum key distribution protocol without basis reconciliation. The presented protocol can greatly improve the generating efficiency of secret keys, reaching 100% in the ideal case, and no classical information is needed. We also analyze the security of the protocol in detail, which shows that the protocol is robust against common attack strategies. Furthermore, the protocol can be implemented with current technologies and open promising possibilities for quantum cryptography.
Quantum key distribution (QKD) relies on quantum and classical procedures in order to achieve the growing of a secret random string -the key- known only to the two parties executing the protocol. Limited intrinsic efficiency of the protocol, imperfect devices and eavesdropping produce errors and information leakage from which the set of measured signals -the raw key- must be stripped in order to distill a final, information theoretically secure, key. The key distillation process is a classical one in which basis reconciliation, error correction and privacy amplification protocols are applied to the raw key. This cleaning process is known as information reconciliation and must be done in a fast and efficient way to avoid cramping the performance of the QKD system. Brassard and Salvail proposed a very simple and elegant protocol to reconcile keys in the secretkey agreement context, known as Cascade, that has become the de-facto standard for all QKD practical implementations. However, it is highly interactive, requiring many communications between the legitimate parties and its efficiency is not optimal, imposing an early limit to the maximum tolerable error rate. In this paper we describe a low-density parity-check reconciliation protocol that improves significantly on these problems. The protocol exhibits better efficiency and limits the number of uses of the communications channel. It is also able to adapt to different error rates while remaining efficient, thus reaching longer distances or higher secure key rate for a given QKD system.
CASCADE protocol is an error detection and correction (EDC) method proposed firstly for use in quantum key distribution (QKD) systems. It is used to detect and correct all the errors in keys transmitted over a noisy quantum channel. This is done by sending some redundant information about the key to receiver as usual. However, just as differently, this extra information is sent over another noiseless classical channel after the quantum transmission is completely finished. Briefly, all the errors in noisy quantum communication are detected and corrected by a later noiseless classical communication using CASCADE protocol. In QKD literature, this EDC process is also called as information reconciliation (IR) or secret key reconciliation (SKR). For an IR protocol in QKD, one of the main performance measures is efficiency which depends on the amount of redundant information sent to make EDC possible. Since this extra information is transmitted over public channels, everyone can get it easily. Because this can damage the secrecy of keys that must be kept secret from third parties, more efficient, that is revealing less information about keys, IR methods are needed. In this paper, we present more efficient implementations of CASCADE protocol, using some inherent information already available in the protocol, exactly known bits and already known parities. This information is used in error detection and correction steps of the protocol to decrease the redundancy in redundant information. Our experiments have shown that the resulting protocols have higher efficiency than both all the previous CASCADE versions and several other more recently proposed IR methods.
Quantum key distribution (QKD) generates symmetric keys between two authenticated parties with the guarantee of information-theoretically security. A vital step in QKD to obtain fully-matched key between two parties is information reconciliation. The blind reconciliation protocol provides a useful tool that corrects the mismatch in a wide range of qubit error rate (QBER) but without a prior error estimation. However, there is a contradiction between the reconciliation efficiency and the processing time in this protocol. In this work, we propose a blind reconciliation protocol with variable step sizes to relieve this contradiction. The analysis and simulation results show that the improved protocol inherits all the advantages of the original blind reconciliation protocol and can obtain better reconciliation efficiency with less operation time. The improved blind reconciliation protocol enhances the final secret key rate and accelerates the processing speed of a QKD system.