We analyze the performance of quantum key distribution (QKD) protocols that rely on discrete phase randomization (DPR). For many QKD protocols that rely on weak coherent pulses (WCPs), continuous phase randomization is assumed, which simplifies the security proofs for such protocols. However, it is challenging to achieve such a perfect phase randomization in practice. As an alternative, we can select a discrete set of global phase values for WCPs, but we need to redo the security analysis for such a source. While security proofs incorporating DPR have been established for several QKD protocols, they often rely on computationally intensive numerical optimizations. To address this issue, in this study, we derive analytical bounds on the secret key generation rate of BB84 and measurement-device-independent QKD protocols in the DPR setting. Our analytical bounds closely match the results obtained from more cumbersome numerical methods in the regions of interest.
We analyze the performance of quantum key distribution (QKD) protocols that rely on discrete phase randomization (DPR). For many QKD protocols that rely on weak coherent pulses (WCPs), continuous phase randomization is assumed, which simplifies the security proofs for such protocols. However, it is challenging to achieve such a perfect phase randomization in practice. As an alternative, we can select a discrete set of global phase values for WCPs, but we need to redo the security analysis for such a source. While security proofs incorporating DPR have been established for several QKD protocols, they often rely on computationally intensive numerical optimizations. To address this issue, in this study, we derive analytical bounds on the secret key generation rate of BB84 and measurement-device-independent QKD protocols in the DPR setting. Our analytical bounds closely match the results obtained from more cumbersome numerical methods in the regions of interest.
Mode-pairing quantum key distribution (MP-QKD) protocol achieves performance beyond the repeaterless rate-transmittance bound and exhibits excellent practicality by avoiding the requirement for difficult global phase locking. However, the source side of MP-QKD still relies on the assumption of continuous phase randomization, an experimentally infeasible requirement in practice. Therefore, the practical security of the protocol cannot be fully guaranteed. In this work, we propose a discrete-phase-randomized mode-pairing quantum key distribution (DPR-MP-QKD) protocol and analyze the basis-dependence of the source side. Then, we introduce a concrete discrete version of the decoy state method that ensures the security of the DPR-MP-QKD protocol. Finally, simulation results indicate that as the number of discrete phases increases, the key rate performance of DPR-MP-QKD progressively approaches that of the continuous case, with convergence achieved at approximately 14 discrete phases. Moreover, our approach drastically lowers the demand for randomness. While conventional continuous phase randomization demands an unlimited supply of random bits, we show that merely a few bits (e.g., 4) are adequate.
Abstract Quantum key distribution (QKD) is a secure communication method that relies on the inherent randomness of quantum mechanics to ensure information-theoretic security. The first and most widely used QKD protocol is BB84, and the proof of BB84's security is vital. The Discrete Phase Randomized BB84 protocol is a variant of the decoy BB84 protocol. It has been proven to be promising in the development of high-speed QKD systems. However, it still lacks an analysis with a finite number of pulses. This paper presents a comprehensive security analysis of the discrete phase BB84 protocol, using two different methods under different conditions. The analysis involves simulations and optimizations to determine the optimal parameter settings. It is confirmed that for typical scenarios, if the number of discrete phases exceeds 30, one can calculate the key rate by assuming that a continuous phase randomization process was in operation. On the other hand, for a relatively smaller number of discrete values, we have developed a numerical method to calculate the key rate. We have confirmed that its performance is reduced but still acceptable with a finite number of pulses.
The use of decoy states in quantum key distribution (QKD) has provided a method for substantially increasing the secret key rate and distance that can be covered by QKD protocols with practical signals. The security analysis of these schemes, however, leaves open the possibility that the development of better proof techniques or better classical postprocessing methods might further improve their performance in realistic scenarios. In this paper, we derive upper bounds on the secure key rate for decoy-state QKD. These bounds are based basically only on the classical correlations established by the legitimate users during the quantum communication phase of the protocol. The only assumption about the possible postprocessing methods is that double click events are randomly assigned to single click events. Further, we consider only secure key rates based on the uncalibrated device scenario which assigns imperfections such as detection inefficiency to the eavesdropper. Our analysis relies on two preconditions for secure two-way and one-way QKD. The legitimate users need to prove that there exists no separable state (in the case of two-way QKD) or that there exists no quantum state having a symmetric extension (one-way QKD) that is compatible with the available measurements results. Both criteria have been previously applied to evaluate single-photon implementations of QKD. Here we use them to investigate a realistic source of weak coherent pulses. The resulting upper bounds can be formulated as a convex optimization problem known as a semidefinite program which can be efficiently solved. For the standard four-state QKD protocol, they are quite close to known lower bounds, thus showing that there are clear limits to the further improvement of classical postprocessing techniques in decoy-state QKD.
Quantum key distribution (QKD) allows two remote parties to share information-theoretic secret keys. Many QKD protocols assume the phase of encoding state can be continuous randomized from 0 to 2π, which, however, may be questionable in the experiment. This is particularly the case in the recently proposed twin-field (TF) QKD, which has received a lot of attention since it can increase the key rate significantly and even beat some theoretical rate-loss limits. As an intuitive solution, one may introduce discrete-phase randomization instead of continuous randomization. However, a security proof for a QKD protocol with discrete-phase randomization in the finite-key region is still missing. Here, we develop a technique based on conjugate measurement and quantum state distinguishment to analyze the security in this case. Our results show that TF-QKD with a reasonable number of discrete random phases, e.g., 8 phases from {0,π/4,π/2,…,7π/4}, can achieve satisfactory performance. On the other hand, we find the finite-size effects become more notable than before, which implies that more pulses should be emit in this case. More importantly, as a the first proof for TF-QKD with discrete-phase randomization in the finite-key region, our method is also applicable in other QKD protocols.
Quantum key distribution (QKD) allows two distant parties to share a secret key and realizes a communication with information-theoretic security by combining it with one-time-pad encryption.Since the Bennett-Brassard 1984 (BB84) protocol was proposed, a large number of researches on QKD have been conducted from both aspects of theory and implementations.For implementations of QKD, weak coherent pulses (WCP) are heavily used as optical signals because they are easily generated by typical lasers and attenuators.The security for QKD with WCP has been also studied along the development of the implementations.In this thesis, the security analysis of the QKD with WCP is considered and further developed from two aspects.First, the security of the differential-quadrature-phase-shift (DQPS) protocol is proved.The DQPS protocol has essentially the same set up as the phase-encoding BB84 (PE-BB84) protocol, which is one of the most frequently demonstrated protocols.Since the known proof techniques for the BB84 protocol is not directly applicable, a modified approach is developed which is suitable for the DQPS protocol.As a result, the advantage of the DQPS protocol in the key generation rate over the PE-BB84 protocol is shown in the asymptotic limit where the size of communication data is assumed to be infinite.Second, a new method for security analysis with finite-key size is proposed as a suitable method for QKD protocols using WCP.Differently from the current method based on simple random sampling, the proposed method relies on Bernoulli sampling, which is associated with binomial distribution.The security of the BB84 protocol is proved by using the Bernoulli-sampling method, enabling a simpler analysis with a smaller number of parameters to be estimated compared to the method with simple random sampling.The required number of detected signals to generate a secret key is shown to be smaller than 10 4 , which is drastic improvement from the number ∼ 10 7 obtained in the previous result.The proposed method is also applied to the DQPS protocol, and its advantage over the PE-BB84 protocol is certified even in the finite-key regime.i
Quantum Key Distribution (QKD) enables theoretically secure key exchange based on fundamental quantum principles such as the no-cloning theorem and Heisenberg’s uncertainty principle. However, practical implementations remain vulnerable to side-channel attacks caused by device imperfections, while many existing studies primarily analyze asymptotic security or isolated attack scenarios rather than realistic finite-key conditions. Unlike prior studies that focus on asymptotic or single-attack analyses, this work presents a comprehensive finite-key security evaluation of BB84 and B92 protocols under hybrid side-channel attacks using Discrete Phase Randomization (DPR) as a lightweight mitigation strategy and the Koashi bound for improved phase-error estimation in B92. Numerical simulations are performed using realistic system parameters with a finite-key size of 100 billion pulses across ten representative attack scenarios. The results show that applying DPR (M = 32) significantly suppresses phase-sensitive attack-induced errors, reducing the quantum bit error rate (QBER) from 11–50% to approximately 1.5–3.02%, thereby restoring practical secure key generation. B92 with the Koashi bound achieves secure transmission distance improvements from 181.6 km to 190.8 km without attacks and reaches 187.0 km under hybrid attacks with DPR, slightly exceeding BB84 in certain conditions. Peak secret key rates reach 0.1363 bit/pulse for BB84 and 0.0741 bit/pulse for B92. These findings demonstrate that non-orthogonal protocols can remain competitive under realistic finite-key constraints using practical mitigation techniques, although literature based induced QBER assumptions remain a limitation.