Sifted Keys Research Articles

Eurasian-scale experimental satellite-based quantum key distribution with detector efficiency mismatch analysis.

The Micius satellite is the pioneering initiative to demonstrate quantum teleportation, entanglement distribution, quantum key distribution (QKD), and quantum-secured communications experiments at the global scale. In this work, we report on the results of the 600-mm-aperture ground station design which has enabled the establishment of a quantum-secured link between the Zvenigorod and Nanshan ground stations using the Micius satellite. As a result of a quantum communications session, an overall sifted key of 2.5 Mbits and a total final key length of 310 kbits have been obtained. We present an extension of the security analysis of the realization of satellite-based QKD decoy-state protocol by taking into account the effect of the detection-efficiency mismatch for four detectors. We also simulate the QKD protocol for the satellite passage and by that validate our semi-empirical model for a realistic receiver, which is in good agreement with the experimental data. Our results pave the way to the considerations of realistic imperfection of the QKD systems, which are important in the context of their practical security.

Sifting scheme for continuous-variable quantum key distribution with short samples

Preventing the secret key from being stolen is an important issue in practical quantum key distribution systems. In the sifting step, the legitimate parties discard the useless portion of the raw data to form the sifted key. This step is executed at high speed to support the high repetition frequency of the systems without guaranteeing the security of the raw data. In practical systems, useless data contain abnormal data and the key measured by the legitimate party on different bases. Here we propose a sifting scheme based on machine learning that can monitor anomaly quantum signal disturbances in practical continuous-variable quantum key distribution systems. It randomly samples small amounts of data from the data block and uses short samples to preliminarily sift the abnormal one. The results show that the model can quickly distinguish normal communication from most common attacks with the cost of a small part of the raw keys and improve system performance under attacks. In principle, the model can also be generalized and applied to discrete-variable quantum key distribution systems and further enhance the security of quantum key distribution.

Shannon-limit approached information reconciliation for quantum key distribution

Information reconciliation (IR) corrects the errors in sifted keys and ensures the correctness of quantum key distribution (QKD) systems. Polar codes-based IR schemes can achieve high reconciliation efficiency; however, the incidental high frame error rate decreases the secure key rate of QKD systems. In this article, we propose a Shannon-limit approached (SLA) IR scheme, which mainly contains two phases: the forward reconciliation phase and the acknowledgment reconciliation phase. In the forward reconciliation phase, the sifted key is divided into sub-blocks and performed with the improved block checked successive cancellation list decoder of polar codes. Afterward, only the failure corrected sub-blocks perform the additional acknowledgment reconciliation phase, which decreases the frame error rate of the SLA IR scheme. The experimental results show that the overall failure probability of SLA IR scheme is decreased to 10^{-8} and the efficiency is improved to 1.091 with the IR block length of 128 Mb. Furthermore, the efficiency of the proposed SLA IR scheme is 1.055, approached to Shannon limit, when the quantum bit error rate is 0.02 and the input scale of 1 Gb, which is hundred times larger than the state-of-the-art implemented polar codes-based IR schemes.

Modified error correction method using one-time pad in qkd systems

This paper analyzes and adapts the known method of error correction of CV-QKD systems, proposed by Mario Milicevic, which modulates a code word with a correlated Gaussian sequence in amplitude and phase quadratures of coherent states, for use in DV-QKD systems, in which information is encoded by single-photon polarization states, by using a sieved key in the form of classical bits, from which the codeword is created, and also a one-time pad (Vernam cipher), which uses a fairly easy to implement classic Boolean “exclusive OR” operation (XOR). The main task of error correction is to correct errors in order to share the same secure key between the two parties (usually called Alice and Bob). Various factors can cause errors. The unreliability of the quantum channel is due to the fact that photons can cause noise when changing the polarization vector of the photon. In the proposed solution, the quantum component of the protocol occurs only in the first stage of transmission of the protected key, where the exchange of photons. The quantum key distribution system has inevitable errors in the sieved key, which must be corrected by the error correction algorithm to create a secure key. Unlike other known QKD systems, where at the stage of error correction the sifted keys are corrected and passed to the next stage of increasing confidentiality, in the modified method it is proposed to use sifted keys as keys in disposable Vernam ciphers, and the vector that will go to the next stage way and combine with the sifted key. The difference in the sieved keys between the two parties is corrected by means of low-density parity check matrices (LDPC), which are known to both of them in advance. Parity check matrices are created by an algorithm proposed by David MacKay and Radford Neal. Radford Neal open-source program code, is used to create final work program to checking proposed algorithm.

Optimal Low Density Parity Check Matrices to Correct Quantum Key Errors for QKD

In this paper, the parity-check matrices that can be used in low density parity check (LDPC) based error correction method for quantum key distribution are analyzed. The quantum key distribution system has inevitable errors in sifted key that must be corrected by an error correction algorithm to create a secure key. In this analysis, 1000-bit sifted keys are divided into 50 parts. The algorithm creates 50 syndromes corresponding to each part by multiplying 10 × 20 bit parity-check matrices. The algorithm sends the generated syndrome to the other side, which also divides the sifted key into 50 parts, creates a syndrome from each part, and compares with the received syndrome. If the syndromes are different, these sifted key parts are discarded. However, there may be situations where different parts may have the same syndromes. Therefore, it is necessary to find such an optimal matrix that removes the probability of getting the same syndromes at different parts of the sifted key.

Improved reconciliation with polar codes in quantum key distribution

Quantum key distribution (QKD) is a cryptographic system that generates an information-theoretically secure key shared by two legitimate parties. QKD consists of two parts: quantum and classical. The latter is referred to as classical post-processing (CPP). Information reconciliation is a part of CPP in which parties are given correlated variables and attempt to eliminate the discrepancies between them while disclosing a minimum amount of information. The elegant reconciliation protocol known as \emph{Cascade} was developed specifically for QKD in 1992 and has become the de-facto standard for all QKD implementations. However, the protocol is highly interactive. Thus, other protocols based on linear block codes such as Hamming codes, low-density parity-check (LDPC) codes, and polar codes have been researched. In particular, reconciliation using LDPC codes has been mainly studied because of its outstanding performance. Nevertheless, with small block size, the bit error rate performance of polar codes under successive-cancellation list (SCL) decoding with a cyclic redundancy check (CRC) is comparable to state-of-the-art turbo and LDPC codes. In this study, we demonstrate the use of polar codes to improve the performance of information reconciliation in a QKD system with small block size. The best decoder for polar codes, a CRC-aided SCL decoder, requires CRC-precoded messages. However, messages that are sifted keys in QKD are obtained arbitrarily as a result of a characteristic of the QKD protocol and cannot be CRC-precoded. We propose a method that allows arbitrarily obtained sifted keys to be CRC precoded by introducing a virtual string. Thus the best decoder can be used for reconciliation using polar codes and improves the efficiency of the protocol.

Effects of afterpulse events on performance of entanglement-based quantum key distribution system

In this paper, we theoretically and experimentally study the performance of an entanglement-based quantum key distribution (QKD) system using single-photon detectors (SPDs) with poor afterpulse characteristics. We reveal that the afterpulse fraction (Pa) in an SPD does not impose a bound on the lowest limit of the error rate in sifted keys of an entanglement-based QKD system. Secure secret key sharing is possible even when Pa is large, for example, exceeding 100%. The system performance in terms of the final key rate is found to be dominated by the parameter η/(1 + Pa) of the SPD, where η is the detection efficiency. The operation conditions of the SPD should be optimized so as to have the maximal η/(1 + Pa), while retaining sufficiently low dark counts. The experimental results were in good agreement with the theoretical predictions. A visibility of 90%, which is sufficiently high for secure secret key sharing in a QKD protocol, was obtained in twofold interference experiments even by using an SPD with Pa exceeding 100%.

A Three-Node QKD Network Based on a Two-Way QKD System

We demonstrate a three-node active quantum key distribution (QKD) network with our previous two-way QKD system. An optical switch is used as a router to connect the two nodes. Adjacent nodes are connected by a 25 km optical fiber. The test over 11 h shows that our system can reduce the Raleigh backscattering efficiently in the absence of the storage fiber. Furthermore, the obtained average sifted key is about 1.2 kbps in the network, with high visibility and low quantum bit error rate in the long-time test.

Implementation of polarization-coded free-space BB84 quantum key distribution

We report on the implementation of a Bennett-Brassard 1984 quantum key distribution protocol over a free-space optical path on an optical table. Attenuated laser pulses and Pockels cells driven by a pseudorandom number generator are employed to prepare polarization-encoded photons. The sifted key generation rate of 23.6 kbits per second and the quantum bit error rate (QBER) of 3% have been demonstrated at the average photon number per pulse μ = 0.16. This QBER is sufficiently low to extract final secret keys from shared sifted keys via error correction and privacy amplification. We also tested the long-distance capability of our system by adding optical losses to the quantum channel and found that the QBER remains the same regardless of the loss.

Experimental Demonstration of a Detection-Time-Bin-Shift Polarization Encoding Quantum Key Distribution System

Detection-time-bin-shift (DTBS) is a scheme that uses time division multiplexing of a single photon detector between two photon bases in a quantum key distribution (QKD) system. This scheme can simplify the structure of a QKD system, reduce its cost and overcome the security problems caused by the dead-time induced self-correlation and the unbalanced characteristics of detectors. In this paper, we introduce an improved DTBS scheme and implement it based on our previously developed conventional fiber-based QKD system using the B92 protocol. Our DTBS QKD system generates sifted keys at a rate of more than 1 Mbit/s with a quantum bit error rate (QBER) lower than 2% over 1.1 km of fiber.

Stop Conditions of BB84 Protocol via a Depolarizing Channel (Quantum Cryptography)

BB84 (Bennett and Brassard 1984) is one of the well known protocols of quantum keys distribution. It is built to allow two interlocutors commonly called Alice and Bob to share two similar binary keys and to detect the eavesdropper presence (the eavesdropper is commonly called Eve). However, Eve presence in a disturbed environment causes errors to the sifted keys and decreases the amount of secure information between Alice and Bob. One of the most important stages in BB84 protocol is to decide by using error probability estimation if we can continue the protocol phases or no. Indeed, this decision is function of some factors like: what is the amount of information that we will lose in the error correction phase? What is the degree of errors detected in our sifted keys? What is the origin of these errors: Eve strategy or the channel disturbance? For these reasons, we will study in this study some conditions to stop BB84 protocol in the context of depolarizing channel. We implement two types of eavesdropping strategy: Intercept and Resend and Cloning Attack.

Differential-phase quantum key distribution experiment using a series of quantum entangled photon pairs

We report what we believe to be the first differential-phase quantum key distribution experiment using a series of quantum entangled photon pairs. We employed two outstanding techniques. As an entangled photon source, we used a 1.5 microm band entangled photon pair source based on spontaneous four-wave mixing in a cooled dispersion-shifted fiber. As receivers, photon pairs were actively phase modulated with LiNbO3 phase modulators followed by very stable planar light-wave circuit Mach-Zehnder interferometers, which provided two nonorthogonal measurements. As a consequence, we successfully generated sifted keys with a quantum bit error rate of 8.3% and a key generation rate of 0.3 bit/s and revealed the feasibility of this QKD scheme.

10-GHz clock differential phase shift quantum key distribution experiment

This paper reports the first quantum key distribution experiment implemented with a 10-GHz clock frequency. We used a 10-GHz actively mode-locked fiber laser as a source of short coherent pulses and single photon detectors based on frequency up-conversion in periodically poled lithium niobate waveguides. The use of short pulses and low-jitter upconversion detectors significantly reduced the bit errors caused by detector dark counts even after long-distance transmission of a weak coherent state pulse. We employed the differential phase shift quantum key distribution protocol, and generated sifted keys at a rate of 3.7 kbit/s over a 105 km fiber with a bit error rate of 9.7%.

Long-distance entanglement-based quantum key distribution

A detailed analysis of quantum key distribution employing entangled states is presented. We tested a system based on photon pairs entangled in energy-time optimized for long-distance transmission. It is based on a Franson-type setup for monitoring quantum correlations, and uses a protocol analogous to the Bennett-Brassard 1984 protocol. Passive-state preparation is implemented by polarization multiplexing in the interferometers. We distributed a sifted key of 0.4 Mbit at a raw rate of 134 Hz and with an error rate of 8.6% over a distance of 8.5 km. We thoroughly discuss the noise sources and practical difficulties associated with entangled-state systems. Finally, the level of security offered by this system is assessed and compared with that of faint-laser-pulse systems.