Quantum key distribution (QKD) is a secure key generation method between two distant parties by wisely exploiting properties of quantum mechanics. In QKD, experimental measurement outcomes on quantum states are transformed by the two parties to a secret key. This transformation is composed of many logical steps (as guided by security proofs), which together will ultimately determine the length of the final secret key and its security. We detail the procedure for performing such classical postprocessing taking into account practical concerns (including the finite-size effect and authentication and encryption for classical communications). This procedure is directly applicable to realistic QKD experiments and thus serves as a recipe that specifies what postprocessing operations are needed and what the security level is for certain lengths of the keys. Our result is applicable to the BB84 protocol with a single or entangled photon source.
Quantum key distribution (QKD) is a secure key generation method between two distant parties by wisely exploiting properties of quantum mechanics. In QKD, experimental measurement outcomes on quantum states are transformed by the two parties to a secret key. This transformation is composed of many logical steps (as guided by security proofs), which together will ultimately determine the length of the final secret key and its security. We detail the procedure for performing such classical postprocessing taking into account practical concerns (including the finite-size effect and authentication and encryption for classical communications). This procedure is directly applicable to realistic QKD experiments and thus serves as a recipe that specifies what postprocessing operations are needed and what the security level is for certain lengths of the keys. Our result is applicable to the BB84 protocol with a single or entangled photon source.
In contrast to classical public-key cryptosystems, where the security of encoded messages relies on on computational assumptions, Quantum Key Distribution (QKD) enables two distant parties to establish a shared secret key that, when combined with a one-time pad, provides information-theoretically secure encryption, provided that the QKD protocol is supported by a rigorous security proof. In the last decades, security proofs robust against a wide range of eavesdropping strategies have established the theoretical soundness of several QKD protocols. However, most proofs are based on idealized models of the physical systems involved in such protocols and often include assumptions that are not satisfied in practical implementations. This mismatch creates a gap between theoretical security guarantees and actual experimental realizations, making QKD protocols vulnerable to attacks. To ensure the security of real-world QKD systems, it is therefore essential to account for imperfections in security analyses. In this article, we present an overview of recent analytical and numerical developments in QKD security proofs, which provide a versatile approach for incorporating imperfections and re-establishing the security of quantum communication protocols under realistic conditions.
Abstract Most modern cryptographic mechanisms are often based on the key distribution schemes, the security of which depends on the computational complexity and the power used to break the encryption. Quantum Key Distribution (QKD) is gaining popularity as a panacea to the issue of secure key distribution due to its ability to show secret keys' information-theoretic protection that is already suitable for commercialization. The goal is to generate a secret key between trusted parties connected through a quantum channel and an authenticated classical channel. The technology promises unconditional secure communication based on the principles of quantum mechanics without limiting the power of an eavesdropper. The first three sections provide a contemporary review of the Quantum Key Distribution in a nutshell. The remaining part of the paper deals with the key parameters and implementations that have been developed to assess the security of the leading experimental platforms and the challenges with respect to the development of this technology such as optimally overlaying the logic gates via quantum-dot cellular automata, which also creates possible avenues for research in the cryptographic domain.
Quantum Key Distribution (QKD) which is the name of cryptography in quantum environment act as the highest developed area in quantum communication and computing technology (QCIT). \n \nQKD is inventive technology which utilize the laws of quantum to create a cryptographic share key to make the communication system secure. The unique feature of QKD assures eavesdropping detectable during quantum communications which is fascinating for a high-level secure environment.Most of the traditional cryptographic methods which we use currently are based on mathematical scheme or Computational complexity theory which are not completely safe. Using quantum cryptography has been achieved extensive steps in communication security establishment. As the information Unit has been changed from “bit” to Quantum bit (Qubit), a new element has been offered that can guarantee the shared information confidentiality between parties. The confidentiality of system is established via exchanging a secret key through a channel of quantum, the key which we use for encrypting the shared data. This structure has quantum integration which has been developed by physics law and techniques of cryptography. \n \nThis thesis has proposed a modified version of QKD protocol, this new protocol will generate a cryptographic share key for a more efficient, lower cost and secure communication between two parties (sender and Receiver). This new protocol principal is similar to BBM92, but the source of photon moved to sender instead of third-party photon generator, following steps will be executed in this Experiment: \n \n•\tObserve different categories protocols of QKD in details \n•\tThe Quantum Mechanics Visualisation Project (QuVis) is the simulation software that has been used for implementing the proposed protocol [BB84 with spin] among the other three (BBM92, B92 and BB84). \n•\tProbability ratio of error will be tested and compared for all protocols, for this experiment 100 to 5000 photons will be sent. \n \nBy Analysing collected data in this experiment, it will be determined which one of this four protocols lead the detecting of eavesdropping. Simulation software accomplishes the value of error key probability which receiver can use and should not pass over the range limit of 0.25 & 0.5.
Decoy states have recently been proposed as a useful method for substantially improving the performance of quantum key distribution (QKD) protocols when a coherent-state source is used. Previously, data postprocessing schemes based on one-way classical communications were considered for use with decoy states. In this paper, we develop two data postprocessing schemes for the decoy-state method using two-way classical communications. Our numerical simulation (using parameters from a specific QKD experiment as an example) results show that our scheme is able to extend the maximal secure distance from 142km (using only one-way classical communications with decoy states) to 181km. The second scheme is able to achieve a 10% greater key generation rate in the whole regime of distances. We conclude that decoy-state QKD with two-way classical postprocessing is of practical interest.
Quantum cryptography, or, more precisely, quantum key distribution (QKD) allows two distant parties, Alice and Bob, to expand a previously shared secret key by sending quantum states through a quantum channel. The goal here is for Alice and Bob to communicate securely in the presence of an eavesdropper, Eve. The most well-known QKD protocol is the Bennett-Brassard 1984 (BB84) protocol, which has been proved unconditionally secure against any attacks allowed by quantum mechanics. The main advantage of QKD over conventional cryptography is its absolute security. Thus, it is imperative to evaluate the security and performance of QKD protocols and realistic QKD systems. In this thesis, we study the security and performance aspects of QKD in four parts. In the first part, we study the Scarani-Acin-Ribordy-Gisin 2004 (SARG04) protocol. This protocol differs from the BB84 protocol only in the classical post-processing step and uses the same four quantum states as the BB84 protocol. We compared these two protocols and showed that in typical situations, the classical post-processing software for BB84 should be used in order to have a higher performance. In the second part, we prove the security of a three-state protocol. This protocol is similar to the BB84 protocol in that they share the same three qubit states. In the third part, we consider a practical Trojan horse attack on practical QKD systems implementing the BB84 protocol. The attack works by taking advantage of the finite response time of practical phase modulators to remap the states sent out by the legitimate user, Alice. We showed that if Alice and Bob are unaware of our attack, the final key shared between them can be compromised in some situations. In the fourth part, we consider another type of Trojan horse attack, which is based on mismatch between detection efficiencies of detectors. Practical detectors in QKD systems usually do not have identical efficiencies and an eavesdropper Eve may be able to exploit this efficiency mismatch to steal information about the final secret key. We analyze the security of the attack and show that it is possible for Eve to acquire some information on the final secret key if Alice and Bob are unaware of this attack.
Quantum key distribution (QKD) technology is a frontier in the field of secure communication, leveraging the principles of quantum mechanics to offer information-theoretically secure keys. Postprocessing is an important part of a whole QKD system because it directly impacts the secure key rate and the security of the system. In particular, with the fast increase in the photon transmission frequency in a QKD system, the processing speed of postprocessing becomes an essential issue. Our study embarks on a comprehensive review of the development of postprocessing of QKD, including five subprotocols, namely, parameter estimation, sifting, information reconciliation, privacy amplification, and channel authentication. Furthermore, we emphasize the issues raised in the implementation of these subprotocols under practical scenarios, such as limited computation or storage resources and fluctuations in channel environments. Based on the composable security theory, we demonstrate how enhancements in each subprotocol influence the secure key rate and security parameters, which can provide meaningful insights for future advancements in QKD.