Finite Key Analysis for Discrete Phase Randomized BB84 Protocol

preprint OA: closed
View at publisher

Abstract

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.

My notes (saved in your browser only)

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2024) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00