Quantum key distribution (QKD), another name for quantum cryptography, is the most advanced subfield of quantum information and communication technology (QICT). The first QKD protocol was proposed in 1984, and since then, more protocols have been proposed. It uses quantum mechanics to enable secure exchange of cryptographic keys. In order to have high confidence in the security of the QKD protocols, such protocols must be proven to be secure against any arbitrary attacks. In this chapter, we discuss and demonstrate security proofs for QKD protocols. Security analysis of QKD protocols can be categorised into two techniques, namely infinite-key and finite-key analyses. Finite-key analysis offers more realistic results than the infinite-key one, while infinite-key analysis provides more simplicity. We briefly provide the background of QKD and also define the basic notion of security in QKD protocols. The cryptographic key is shared between Alice and Bob. Since the key is random and unknown to an eavesdropper, Eve, she is unable to learn anything about the message simply by intercepting the ciphertext. This phenomenon is beyond the ability of classical information processing. We then study some tools that are used in the derivation of security proofs for the infinite- and finite-length key limits.
Quantum key distribution (QKD), another name for quantum cryptography, is the most advanced subfield of quantum information and communication technology (QICT). The first QKD protocol was proposed in 1984, and since then, more protocols have been proposed. It uses quantum mechanics to enable secure exchange of cryptographic keys. In order to have high confidence in the security of the QKD protocols, such protocols must be proven to be secure against any arbitrary attacks. In this chapter, we discuss and demonstrate security proofs for QKD protocols. Security analysis of QKD protocols can be categorised into two techniques, namely infinite-key and finite-key analyses. Finite-key analysis offers more realistic results than the infinite-key one, while infinite-key analysis provides more simplicity. We briefly provide the background of QKD and also define the basic notion of security in QKD protocols. The cryptographic key is shared between Alice and Bob. Since the key is random and unknown to an eavesdropper, Eve, she is unable to learn anything about the message simply by intercepting the ciphertext. This phenomenon is beyond the ability of classical information processing. We then study some tools that are used in the derivation of security proofs for the infinite- and finite-length key limits.
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.
The counter-intuitive features of quantum mechanics make it possible to solve problems and perform tasks that are beyond the abilities of non-quantum (classical) computers and communication devices. The field of quantum information processing studies how we can achieve such improvements by representing information as quantum states.One of the early achievements of quantum information processing is the development of quantum key distribution (QKD). QKD protocols allow two participants (Alice and Bob) to achieve the classically-impossible task of generating a secret shared key even if their adversary is computationally unlimited.Unfortunately, the security promises of QKD are true only in theory; practical implementations of QKD deviate from the theoretical protocols, and many of these deviations give rise to practical attacks. In this research thesis, we study the security properties of various QKD protocols in many practical settings:First, we study practical security of semiquantum key distribution (SQKD) protocols, where either Alice or Bob is non-quantum (classical). Following practical security problems in previous SQKD protocols, we suggest a new SQKD protocol (the "Mirror protocol") which can be securely implemented, and we prove it robust and secure against a wide range of attacks (the "uniform collective attacks").Then, we study "composable security" of the first QKD protocol created by Bennett and Brassard (BB84). BB84 has its unconditional security proved against adversaries performing the most general attacks in a theoretical (idealized) setting; however, some security approaches do not prove "composable security", which requires the secret key to remain secret even when Alice and Bob actually use it for cryptographic purposes. We generalize an algebraic security approach for BB84, making it prove composable security of BB84 (and many variants of BB84) against the most general attacks.Finally, we analyze an important practical attack (named "Bright Illumination"), showing how it can be modeled as a theoretical "Reversed-Space" attack.Overall, all results aim to enhance our understanding on how to bridge the gap between theory and practice in various sub-fields of QKD, and they may help solve a major open problem in the field of QKD: constructing a realistic QKD implementation that can be proved truly and unconditionally secure against any possible attack.
Quantum cryptography provides secret communication, which offers various security factors like confidentiality, integrity, and authentication assurance based on the law of physics. The law of physics states that quantum computing can also be applied into the communication sector, which is particularly in the field of cryptography. Then quantum can significantly distribute the data securely by applying quantum key distribution (QKD), quantum key sharing, etc. In the classical cryptography, it is difficult to compute secret keys using security concepts like key exchange and authentication, etc., and it fails to provide adequate protection during data communication as it needs some effective computation in terms of security. The lack of security in the data communication can be overcome by using the concept of quantum computing. Generally, in quantum computing, elementary quantum systems like polarized photons are used to transmit digital information based on the principle of uncertainty as it gives rise to a significant phenomenon of effective security in terms of communication compared to existing concepts related to cryptography. In quantum computing, the detection ratio for identifying the data which are sent through a communication channel is more difficult as it uses qubits and photons to represent the data that are sent. Quantum channels are used to distribute the information between two users as it passes through the unprotected classical channels as it is unknown to anyone else. Assuming that Alice and Bob use a latent noise channel to send a key, reconciliation is the process of correcting errors between Alice and Bob’s version of the key. This is done by public discussion, which leaks some information about the secret key to an undercover. This chapter gives a discussion on QKD concepts as it helps to provide a secure communication, where the information is broadcasting through a quantum channel. Finally, the various existing quantum protocols are described in relation to some security measures based on QKD, and the standard QKD protocol of BB84 is discussed.
Quantum cryptography promises secure communication protocols that surpass the limitations of classical cryptography. By leveraging the principles of quantum mechanics, particularly the phenomenon of quantum entanglement and the uncertainty principle, quantum cryptography protocols offer provable security guarantees against eavesdropping attacks. In this paper, we provide an overview of quantum cryptography, discussing its theoretical foundations, key protocols such as quantum key distribution (QKD), and experimental implementations. We highlight the advantages of quantum cryptography over classical cryptographic techniques and explore its potential applications in secure communication networks, financial transactions, and data privacy. Furthermore, we discuss ongoing research efforts and challenges in the practical deployment of quantum cryptography systems, including the development of robust quantum hardware and the integration of quantum cryptographic protocols into existing communication infrastructures. Overall, quantum cryptography holds great promise for enabling secure communication channels that are resilient to quantum attacks, paving the way for a new era of ultra-secure information exchange.
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.
This chapter investigates the security dynamics of Quantum Key Distribution (QKD) by contrasting it with classical security methods and examining the resilience of QKD against various theoretical and practical threats. Initially, it highlights the vulnerabilities of traditional cryptographic systems to quantum computing, noting the potential of quantum algorithms like Shor's to compromise widely used encryption standards such as RSA and Elliptic Curve Cryptography (ECC). It then introduces quantum security techniques, emphasizing QKD's foundational reliance on quantum mechanics' principles—such as the uncertainty principle, the no-cloning theorem, and entanglement—to establish a security paradigm secure against both classical and quantum adversaries. The chapter provides a detailed analysis of common QKD protocols, evaluating their security mechanisms, resistance to eavesdropping, and practical implementation challenges. It discusses the operational principles underlying these protocols and assesses their potential in practical applications, given the current technological constraints and security requirements. Various attacks on QKD, including side-channel and eavesdropping attacks, are reviewed to outline the ongoing necessity for advanced security measures beyond theoretical guarantees. Further, the discussion extends to quantum-resistant algorithms and protocols, which are designed to withstand the power of quantum computers by leveraging problems deemed computationally hard for both classical and quantum systems. It elaborates on the infrastructural needs and challenges of implementing a quantum-resistant framework, critical for a secure transition into the quantum era. This chapter concludes by reflecting on the broader implications of integrating quantum security methodologies like QKD into modern cryptographic practices. It argues for the evolution of security strategies to address emerging risks effectively and explains the importance of continual advancements in quantum technologies and security protocols to safeguard data against the progressively sophisticated landscape of cyber threats.