Following its etymology, the term cryptography denotes the techniques used to ensure the confidentiality of information in its storage or transmission. Besides confidentiality, cryptography also encompasses other important functions such as authentication, signature, non-repudiation or secret sharing, to name just a few. The purpose of this section is to give a short introduction to classical cryptography, but only for areas that are relevant to quantum cryptography. For our purposes, we will only deal with confidentiality and authentication. The former is the most important function that quantum key distribution helps to achieve, while the latter is a requirement for quantum key distribution to work. Also, we will cover some topics on the security of classical cryptographic schemes so as to give some insight when comparing classical and quantum cryptography. The study of cryptography ranges from the analysis of cryptographic algorithms (or primitives ) to the design of a solution to a security problem. A cryptographic algorithm is a mathematical tool that provides a solution to a very specific problem and may be based on premises or on other primitives. A solution can be designed by combining primitives, and the requirements and functions of the primitives have to be combined properly. We will first review the confidentiality provided by ciphers that use the same key for both encryption and decryption, hence called secret-key ciphers . Then, we will discuss authentication techniques. Finally, we will show some aspects of public-key cryptography .
Following its etymology, the term cryptography denotes the techniques used to ensure the confidentiality of information in its storage or transmission. Besides confidentiality, cryptography also encompasses other important functions such as authentication, signature, non-repudiation or secret sharing, to name just a few. The purpose of this section is to give a short introduction to classical cryptography, but only for areas that are relevant to quantum cryptography. For our purposes, we will only deal with confidentiality and authentication. The former is the most important function that quantum key distribution helps to achieve, while the latter is a requirement for quantum key distribution to work. Also, we will cover some topics on the security of classical cryptographic schemes so as to give some insight when comparing classical and quantum cryptography. The study of cryptography ranges from the analysis of cryptographic algorithms (or primitives ) to the design of a solution to a security problem. A cryptographic algorithm is a mathematical tool that provides a solution to a very specific problem and may be based on premises or on other primitives. A solution can be designed by combining primitives, and the requirements and functions of the primitives have to be combined properly. We will first review the confidentiality provided by ciphers that use the same key for both encryption and decryption, hence called secret-key ciphers . Then, we will discuss authentication techniques. Finally, we will show some aspects of public-key cryptography .
This final chapter concerns cryptography , the principle of securing information against access or tampering by third parties. Classical cryptography refers to the manipulation of classical bits for this purpose, while quantum cryptography can be viewed as doing the same with qubits . I describe these two approaches in the same chapter, as in my view the field of cryptography should be understood as a whole and appreciated within such a broader framework, as opposed to focusing on the specific applications offered by the quantum approach. I, thus, begin by introducing the notions of message encryption , message decryption , and code breaking , the action of retrieving the message information contents without knowledge of the code's secret algorithm or secret key . I then consider the basic algorithms to achieve encryption and decryption with binary numbers, which leads to the early IBM concept of the Lucifer cryptosystem , which is the ancestor of the first data encryption standard (DES). The principle of double-key encryption , which alleviates the problem of key exchange , is first considered as an elegant solution but it is unsafe against code-breaking. Then the revolutionary principles of cryptography without key exchange and public-key cryptography (PKC) are considered, the latter also being known as RSA . The PKC–RSA cryptosystem is based on the extreme difficulty of factorizing large numbers . This is the reason for the description made earlier in Chapter 20 concerning Shor's factorization algorithm .
In this section, I wish to put quantum key distribution (QKD) in the wider context of a cryptosystem. I shall discuss informally some aspects that are considered important. The questions I wish to answer here are: “What are the ingredients needed to make a QKD-based cryptosystem work? What services does it bring? What are its limitations?” As I shall detail below, QKD may be used to provide the users with confidential communications. This can be achieved when we combine QKD and the one-time pad. For the quantum modulation, QKD needs a source of truly random numbers. Also, QKD requires a classical authenticated channel to work, so authentication plays an essential role. As a consequence, QKD must start with a secret key, making it a secret-key encryption scheme. I will also discuss what happens if classical cryptography is introduced in the system. Finally, I will describe the implementation of a simple cryptosystem on top of QKD. A key distribution scheme The first function of QKD is to distribute a secret key between two parties. The use of this key is outside the scope of this first section – the need for a secret key is omnipresent in cryptography. As depicted in Fig. 5.1, QKD relies on a classical authenticated channel for sifting and secret-key distillation and on random bits for the modulation of quantum states. The key produced by QKD can be intended for encryption purposes – this will be discussed in Section 5.2 – but is also required by authentication. A part of the distributed key is used for authentication. When QKD is run for the first time, however, an initial secret key must be used instead.
Quantum computing and quantum cryptography are two areas of research that have the potential to transform modern computing and communication. Quantum computing promises to solve computational problems that are beyond the reach of classical computers, while quantum cryptography provides a way to secure communication channels that is immune to eavesdropping. Quantum cryptography is one of the emerging topics in the field of computer industry. This article focuses on quantum cryptography and how this technology makes a valuable contribution to an intensive defense strategy of completely secure key distribution. The scope of this article covers the weaknesses of modern digital cryptographic systems, the basic concepts of quantum cryptography, the practical implementations of this technology, and its limitations. , and finally the future direction that quantum cryptography is headed. We describe the result of an apparatus and protocol designed to perform quantum key distribution, whereby two users do not share any secret information (no private or public keys are known). previously known) initially exchanges a random quantum transmission consisting of veryweakly polarized light rays. In particular, readers can explore the following topics in depth: current cryptographic schemes (symmetric and asymmetric), the difference between quantum and classical computing, challenges of quantum computing, quantum algorithms (Shor and Grover), public key cryptographic schemes affected, symmetry affected schemes, impact on hash functions and post-quantum cryptography
Security knowledge is one of the foremost challenges in the present day. When the topic is about Information security, the concept of cryptography comes into the picture. Every day, people and organizations use cryptography to maintain the confidentiality of their communications and data as well as to preserve their privacy. Today, one of the most successful methods used by businesses to protect their storage systems, whether at rest or in transit, is cryptography. Yet, cryptography is an effective technique to secure the data, the modern technology can break the cryptographic techniques. But some data encryption algorithms are several times stronger than today's conventional cryptography and can be constructed using quantum computing. They are "Quantum Cryptographic Algorithms ". Quantum cryptography uses the rules of quantum physics instead of classical encryption, which is based on mathematics, to protect and transmit data in a way that cannot be intercepted. Quantum key distribution is the greatest illustration of quantum cryptography and offers a safe solution to the key exchange issue. The proposed work deals with quantum cryptography and mainly focuses on how the quantum cryptographic algorithm is more secure than traditional cryptography.
Abstract If the security assessments are not trusted, especially in cases of very high data security requirements, physical methods must be used for key generation and distribution, data encryption, and integrity and authenticity procedures. This ensures the confidentiality, integrity, and authenticity of the data against computationally powerful adversaries and mathematical attack methods that are still unknown (unpublished) today. This chapter provides an introduction to these topics, briefly compares mathematical methods, and discusses the generation and distribution of cryptographic keys, as well as QKD (Quantum Key Distribution), RKD (Radio signal Key Distribution), and MKD (Memeory Key Distribution).
The rapid advancement of quantum computing is poised to disrupt the foundations of classical cryptography, calling into question the long-term security of widely used algorithms. Classical cryptographic techniques, including symmetric key algorithms like DES, 3DES and AES, asymmetric schemes such as RSA and ECC, and essential primitives like hash functions and the One-Time Pad (OTP), have been the cornerstone of secure digital communication since their inception. However, the progress of quantum algorithms, spearheaded by Shor and Grover, poses serious threats to these schemes, necessitating a shift in cryptographic design. This paper presents an all-encompassing review of classical cryptographic techniques, along with emerging post-quantum cryptographic (PQC) algorithms that have been developed to provide quantum-resistant security while maintaining compatibility with classical infrastructure. Concurrently, the quantum key distribution (QKD) introduces a radical shift, leveraging quantum mechanics principles to attain unconditional security. This paper elaborates both Discrete Variable (DV-QKD) and Continuous Variable (CV-QKD) approaches, highlighting their operational principles and security models. By providing a relative analysis of classical cryptographic methods, PQC, and quantum cryptography, including QKD protocols and quantum-safe primitives, this work targets to provide a consolidated insight into modern cryptographic landscape and further research toward secure communication in the quantum era.