Abstract We discuss the photon number splitting attack (PNS) in systems of quantum cryptography with phase coding. It is shown that this attack, as well as the structural equations for the PNS attack for phase encoding, differs physically from the analogous attack applied to the polarization coding. As far as we know, in practice, in all works to date processing of experimental data has been done for phase coding, but using formulas for polarization coding. This can lead to inadequate results for the length of the secret key. These calculations are important for the correct interpretation of the results, especially if it concerns the criterion of secrecy in quantum cryptography.
Abstract We discuss the photon number splitting attack (PNS) in systems of quantum cryptography with phase coding. It is shown that this attack, as well as the structural equations for the PNS attack for phase encoding, differs physically from the analogous attack applied to the polarization coding. As far as we know, in practice, in all works to date processing of experimental data has been done for phase coding, but using formulas for polarization coding. This can lead to inadequate results for the length of the secret key. These calculations are important for the correct interpretation of the results, especially if it concerns the criterion of secrecy in quantum cryptography.
Abstract The decoy state method has been proposed to detect a photon number splitting (PNS) attack. Today, the decoy state method is considered to be an almost universal method for proving the secrecy of quantum cryptography protocols and calculating the length of a secret key. In this paper, it is shown that there exist attacks, for example, a beam splitting (BS) attack, to which the decoy state method turns out to be insensitive. The decoy state method is oriented to the detection of changes in the photocount statistics of information states and decoy states under a PNS attack. Under a BS attack, the photocount statistics is not changed. As a result, the decoy state method significantly overestimates the length of the key. Thus, the decoy state method is not a universal method that allows the detection of various attacks. Apparently, due to a large number of publications on the decoy state method, a widespread opinion has been formed that this method is universal. This fact has led to attempts to adopt this method as an international standard in quantum cryptography, which is clearly premature.
Abstract The cryptographic robustness of quantum key distribution (QKD) with phase–time coding against a photon number splitting (PNS) attack is analyzed. The line length up to which a secret key distribution is guaranteed is determined both by the protocol itself and by the efficiency of error correction in raw keys. The effect of different parameters of avalanche single-photon detectors on the length of the secret key distribution line is investigated. To correct errors, various versions of low-density parity-check (LDPC) codes are considered whose efficiency today is the closest to the Shannon theoretical limit.
Abstract Quantum cryptography or, more precisely, quantum key distribution (QKD), is one of the advanced areas in the field of quantum technologies. The confidentiality of keys distributed with the use of QKD protocols is guaranteed by the fundamental laws of quantum mechanics. This paper is devoted to the decoy state method, a countermeasure against vulnerabilities caused by the use of coherent states of light for QKD protocols whose security is proved under the assumption of single-photon states. We give a formal security proof of the decoy state method against all possible attacks. We compare two widely known attacks on multiphoton pulses: photon-number splitting and beam splitting. Finally, we discuss the equivalence of polarization and phase coding.
The existing decoy-state quantum key distribution (QKD) beating photon-number-splitting (PNS) attack provides a more accurate method to estimate the secure key rate, while it still considers that only single-photon pulses can generate secure keys in any case. However, multiphoton pulses can also generate secure keys if we can detect the possibility of PNS attack in the channel. The ultimate goal of this line of research is to confirm the absence of all types of PNS attacks. In particular, the PNS attack mentioned and detected in this paper is only the weaker version of PNS attack which significantly changes the observed values of the legitimate users. In this paper, under the null hypothesis of no weaker version of PNS attack, we first determine whether there is an attack or not by retrieving the missing information of the existing decoy-state protocols, extract a Cauchy distribution statistic, and further provide a detection method and the type I error probability. If the result is judged to be an attack, we can use the existing decoy-state method and the GLLP formula to estimate the secure key rate. Otherwise, the pulses with the same basis received including both single-photon pulses and multiphoton pulses, can be used to generate the keys and we give the secure key rate in this case. Finally, the associated experiments we performed (i.e., the significance level is 5%) show the correctness of our method.
For a start, Quantum Key Distribution offers security not depending on any fundamental assumption. However, actual realizations choose to use weak coherent pulses as photon sources, rather than the ideal single-photon state, which bears security weaknesses due to the emission of sporadic multi-photon states. These states can be used in Photon-Number Splitting (PNS) attacks, where the attacker intercepts and buffers photons of multi-photon pulses and forwards the rest, enabling partial recovery of the key without inducing detectable perturbations. This article presents a simulation-based approach to analyze PNS attacks with realistic channel conditions like losses, detector imperfections, and finite key lengths. The research also examines the performance of decoy-state countermeasures, that use variable-intensity pulses to statistically reveal eavesdropping and Simulation results confirm the dominant character of PNS on raw key rates for the no-countermeasure scenario and ensure optimal decoy-state schemes restore security by cutting single-photon contributions. Results establish that although WCP QKD is vulnerable to PNS attacks in theory, strict adoption of decoy-state protocols aided with monitoring and finite-key analysis can provide immunity against an adversary. The paper emphasizes the need for simulation-based, implementation-dependent security analysis in direction towards well-designed practical quantum cryptographic systems. [1] [2] [3] [4] [10] [8]
For a start, Quantum Key Distribution offers security not depending on any fundamental assumption. However, actual realizations choose to use weak coherent pulses as photon sources, rather than the ideal single-photon state, which bears security weaknesses due to the emission of sporadic multi-photon states. These states can be used in Photon-Number Splitting (PNS) attacks, where the attacker intercepts and buffers photons of multi-photon pulses and forwards the rest, enabling partial recovery of the key without inducing detectable perturbations. This article presents a simulation-based approach to analyze PNS attacks with realistic channel conditions like losses, detector imperfections, and finite key lengths. The research also examines the performance of decoy-state countermeasures, that use variable-intensity pulses to statistically reveal eavesdropping and Simulation results confirm the dominant character of PNS on raw key rates for the no-countermeasure scenario and ensure optimal decoy-state schemes restore security by cutting single-photon contributions. Results establish that although WCP QKD is vulnerable to PNS attacks in theory, strict adoption of decoy-state protocols aided with monitoring and finite-key analysis can provide immunity against an adversary. The paper emphasizes the need for simulation-based, implementation-dependent security analysis in direction towards well-designed practical quantum cryptographic systems. [1] [2] [3] [4] [10] [8]