This paper describes the security of quantum key distribution (QKD) to share a random secret string of digits between two parties based on the principle of quantum mechanics. A Colderbank-Shor-Steane quantum code had been implicitly used in the BB84 protocol, which makes fidelity of this code to unity and the mutual information between the shared key and the data obtained approaches zero. In the BB84 protocol, the sender transmits digits from which encoded into an orthogonal basis or the conjugate basis. These CSS codes achieve a higher rate called as Shannon rate.
This paper describes the security of quantum key distribution (QKD) to share a random secret string of digits between two parties based on the principle of quantum mechanics. A Colderbank-Shor-Steane quantum code had been implicitly used in the BB84 protocol, which makes fidelity of this code to unity and the mutual information between the shared key and the data obtained approaches zero. In the BB84 protocol, the sender transmits digits from which encoded into an orthogonal basis or the conjugate basis. These CSS codes achieve a higher rate called as Shannon rate.
After Mayers (1996, 2001) gave a proof of the security of the Bennett-Brassard 1984 (BB84) quantum key distribution protocol, Shor and Preskill (2000) made a remarkable observation that a Calderbank-Shor-Steane (CSS) code had been implicitly used in the BB84 protocol, and suggested its security could be proven by bounding the fidelity, say F(n), of the incorporated CSS code of length n in the form 1-F(n) <= exp[-n E+o(n)] for some positive number E. This work presents such a number E=E(R) as a function of the rate of a code R, and a threshold R' such that E(R)>0 whenever R < R', which is larger than the achievable rate based on the Gilbert-Varshamov bound that is essentially due to Shor and Preskill (2000). The codes in the present work are robust against fluctuations of channel parameters, which fact is needed to establish the security rigorously and was not proved for rates above the Gilbert-Varshamov rate before in the literature. As a byproduct, the security of a modified BB84 protocol against any joint (coherent) attacks is proved quantitatively.
Quantum key distribution (QKD) allows authenticated parties to share secure keys. Its security comes from quantum physics rather than computational complexity. The previous work has been able to demonstrate the security of the BB84 protocol based on the uncertainty principle, entanglement purification and information theory. In the security proof method based on entanglement purification, it is assumed that the information of Calderbank–Shor–Steane (CSS) error correction code cannot be leaked, otherwise, it is insecure. However, there is no quantitative analysis of the relationship between the parameter of CSS code and the amount of information leaked. In the attack and defense strategy of the actual quantum key distribution system, especially in the application of the device that is easy to lose or out of control, it is necessary to assess the impact of the parameter leakage. In this paper, we derive the relationship between the leaked parameter of CSS code and the amount of the final key leakage based on the BB84 protocol. Based on this formula, we simulated the impact of different CSS code parameter leaks on the final key amount. Through the analysis of simulation results, the security of the BB84 protocol is inversely proportional to the value of [Formula: see text] and [Formula: see text] in the case of the CSS code leak.
The secure prepare-and-measure BB84 quantum key distribution (QKD) protocol implicit in the Shor-Preskill security proof is based on Calderbank-Shor-Steane (CSS) codes. The latter rely on the existence of pairs of good codes with mutually orthogonal parity check matices, which are hard to construct. Here we show that the orthogonality requirement can be lifted at a small price: instead of a QKD protocol we obtain a quantum key expansion (QKE) protocol, capable of increasing the size of a pre-shared key by a constant factor. Our construction is based on the recently discovered entanglement-assisted quantum codes of Brun, Devetak and Hsieh.
It all begun by the early 1970s through, the work of Stephen Wiesner and Gilles Brassard, who introduced the concept of quantum conjugate coding, and it has now stretched to a level where today's agile communication systems constitute a substantial challenge for data security and safety. A number of research has been performed to achieve secure communication among legitimate parties in which QKD (Quantum Key Distribution) is prominent. Quantum Key Distribution (QKD), also called Quantum Cryptography, enables two communicating parties to share secret cryptographic keys with security that is theoretically guaranteed by the laws of quantum mechanics, assuming ideal conditions. However, practical implementations may be vulnerable to certain attacks, and the security of QKD can be compromised by imperfections in hardware, side-channel attacks, or limitations in real-world setups. In a practical QKD setup, two stations send and receive encoded quantum particles and some classical information. The most rudimentary and well-known QKD protocol is BB84, developed by Bennet and Brassard in 1984. We have developed the simulation and achieved the secret shared key with and without an intruder.
Implementing Quantum Key Distribution (QKD) using the BB84 protocol. The system allows two users to securely share a secret key by simulating quantum protocol using classical computer algorithms to manage and process the data. Random bits are generated, encoded into quantum states, and transmitted virtually between sender and receiver. After transmission, both users compare selected bits to detect error. Classical algorithms are then applied for error correction, key verification, and privacy amplification to produce a final shared secret key. By combining the power of quantum simulation with classical computing algorithms, the project achieves a secure, efficient, and practical approach to key distribution. This integration demonstrates how cloud-based quantum tools and classical algorithms can work together to build reliable and secure communication systems.
One promising way to use quantum information to secure everyday communication is through the distribution of quantum keys. By exchanging a secret key, the Quantum Key Distribution (QKD) approach allows two parties to communicate securely.BB84 protocol is among the most well-known QKD protocols. In this protocol, qubits are exchanged via a quantum channel between the sender and the receiver. This enables them to produce a shared key that is impenetrable to eavesdroppers and illustrate the fundamental ideas of QKD using current simulations and implementations. The results of this study demonstrate that the BB84 protocol is a highly secure QKD technique that has been investigated in great detail and used in a variety of contexts. Additionally, over the enhancements made to the BB84 protocol such as the use of advanced error correction techniques and decoy states to increase its security and usability is discussed. With an emphasis on the BB84 protocol in secure communication technologies, this study offers an extensive analysis of QKD systems overall.