This chapter describes the main types of quantum cryptography, including random number generators (RNGs), hashes, key distribution, and digital signatures. American Charles Bennett and Canadian Gilles Brassard are considered two of the fathers of quantum cryptography. Quantum-based RNGs (QRNGs) are created in various ways and use different quantum materials and mechanisms to generate truly random numbers. All quantum devices using entanglement, including QRNGs, should always be tested to make sure they pass Bell's tests. Quantum-based hashes can take either traditional binary inputs or quantum inputs and return a hash based on quantum states. A quantum-based digital signature requires a quantum hash, a quantum-based asymmetric key pair, and a quantum-based digital signature algorithm, all represented by quantum properties. Just like in the traditional binary world, quantum encryption ciphers can be symmetric or asymmetric. In theory, quantum key distribution systems are resistant to eavesdropping because of the quantum physics observer effect and no-cloning theorems.
This chapter describes the main types of quantum cryptography, including random number generators (RNGs), hashes, key distribution, and digital signatures. American Charles Bennett and Canadian Gilles Brassard are considered two of the fathers of quantum cryptography. Quantum-based RNGs (QRNGs) are created in various ways and use different quantum materials and mechanisms to generate truly random numbers. All quantum devices using entanglement, including QRNGs, should always be tested to make sure they pass Bell's tests. Quantum-based hashes can take either traditional binary inputs or quantum inputs and return a hash based on quantum states. A quantum-based digital signature requires a quantum hash, a quantum-based asymmetric key pair, and a quantum-based digital signature algorithm, all represented by quantum properties. Just like in the traditional binary world, quantum encryption ciphers can be symmetric or asymmetric. In theory, quantum key distribution systems are resistant to eavesdropping because of the quantum physics observer effect and no-cloning theorems.
Cryptography is the study and practice of secure communication with digital data and focuses on confidentiality, integrity, and authentication. Random number generators (RNGs) generate random numbers to enhance security. Even though the cryptographic algorithms are public and their strength depends on the keys, cryptoanalysis of encrypted ciphers can significantly contribute to the unveiling of the cipher’s key. Therefore, to ensure high data security over a network, researchers need to improve the randomness of keys as they develop cryptosystems. Quantum particles have a leading edge in advancing RNG technology as they can provide true randomness, unlike pseudo-random numbers generators (PRNGs). In order to increase the level of the security of cryptographic systems based on random numbers, this survey focuses on three objectives: Cryptosystems with related cryptographic attacks, RNG-based cryptosystems, and the design of quantum random number generators (QRNGs). This survey aims to provide researchers with information about the importance of RNG-based ciphers and various research techniques for QRNGs that can incorporate quantum-based true randomness in cryptosystems.
A cryptosystem is a collection of algorithms used to securely encrypt or decrypt messages by transforming plaintext to ciphertext. The abbreviation “cryptosystem” stands for “cryptographic system” and designates a computer system that employs cryptography, a technique for securing electronic information so only authorized users may read and process it. Prototype quantum cryptography devices are now securing Internet traffic in the nation's largest cities. The third and final major development in the evolution of cryptography in the 20th century might be regarded as quantum key distribution i.e. QKD or quantum cryptography. The level of security of the cryptographic scheme depends on the key employed. A secure message, such as a credit card number or other sensitive information, is sent over the internet using cryptosystems. For instance, a platform for secured electronic mail might incorporate key management procedures, strong cryptographic functions, and digital signature systems. Another use of cryptography may be a secure electronic mail system that uses key management procedures, cryptographic hash functions, and digital signature mechanisms. The following is a breakdown of the chapter's structure. The fundamentals of classical cryptography, symmetric and asymmetric encryption are described in Section 14.1. The principle of quantum cryptography is presented in Section 14.2. The Quantum Key Distribution Protocols are discussed in Section 14.3. The impact of the sifting and distillation steps on the key size is Section 14.4, crypt-analysis in Section 14.5, Quantum Key Distribution in the real world and conclusions are discussed in Section 14.6.
This chapter covers how quantum computing is likely capable of breaking most forms of traditional public key encryption. It begins by discussing cryptography basics, paying particular attention to how most of today's public key encryption schemes provide protection. Cryptography basics cover digital encryption, authentication, and integrity hashing basics. The major cryptographic functions of symmetric ciphers, asymmetric ciphers, and integrity hashing functions provide a wide range of services to the computer world, and by extension, to the real world. Common cryptographic uses include the following: encryption, authentication and digital signing. Quantum computers are capable of breaking many forms of traditional cryptography because of their inherent quantum properties coupled with quantum algorithms, which take advantage of those properties and shortcut the math. Quantum computers and quantum properties cannot magically break every known cryptography cipher. They can break only ciphers that rely on particular functions that are susceptible to quantum properties and quantum algorithms for their protections.
Classical cryptography relies on the assumption that nobody can solve a certain difficult mathematical problem in a realistic amount of time or rely on information theory arguments. Quantum cryptography relies instead on fundamental quantum physics laws. Using large quantum computers, one could break all classical asymmetric algorithms currently used for key distribution and digital signatures. Quantum computing seems to threaten many of the encryption systems in use today, which assume that nobody can solve a difficult mathematical problem in a realistic amount of time. Fabio Cavaliere, John Mattsson and Ben Smeets of Ericsson Research provide an overview of the technologies and protocols for Quantum key distribution (QKD) systems, discuss their security implications and examine standardisation activities for QKD networks. They also introduce quantum random number generators (QRNGs) as an important building block for both classical and quantum encryption systems, and address the security challenges posed by the advent of quantum computers.
Random number generators (RNG) are an important resource in many areas: cryptography (both quantum and classical), probabilistic computation (Monte Carlo methods), numerical simulations, industrial testing and labeling, hazard games, scientific research etc. Because today's computers are deterministic, they can not create random numbers unless complemented with a physical RNG. Randomness of a RNG can be defined and scientifically characterized and measured. Especially valuable is the information-theoretic provable RNG which, at state of the art, seem to be possible only by harvest of randomness inherent to certain (simple) quantum systems and such a generator we call Quantum RNG (QRNG). On the other hand, current industry standards dictate use of RNGs based on free running oscillators (FRO) whose randomness is derived from electronics noise present in logic circuits and which, although quantum in nature, cannot be strictly proven. This approach is currently used in FPGA and ASIC chips. We compare weak and strong aspects of the two approaches for use in cryptography and in general. We also give an alternative definition of randomness, discuss usage of single photon detectors in realization of QRNGs and give several examples where QRNG can significantly improve security of a cryptographic system.
Irrespective of the duration for which the classical system based on bits remains secure, the imminent advent of quantum systems demands a robust cryptographic mechanism to safeguard both manifest data and the existing system’s structure and infrastructure against various threats. Quantum mechanics may provide a solution in the form of quantum key distribution (QKD), a set of processes designed to generate and exchange cryptographic keys between two parties. Each unique method and algorithm within QKD can be characterized as a protocol. In 1984, Charles Bennett and Gilles Brassard introduced the first QKD protocol, BB84. Subsequent QKD protocols have been developed based on different principles, including Heisenberg’s uncertainty principle, polarization, entanglement, and the non-cloning theory. Other scientists have enhanced some QKD protocols, leading to variations with different names. However, not all these protocols can be implemented in classical systems, as they specifically require a quantum system. The current challenge revolves around the complex and pressing need to develop a QKD protocol that can function effectively on classical systems, quantum systems, or both. In the chapter, QKD protocols are comprehensively examined, with each protocol being meticulously reviewed through technical steps elucidating how the protocol facilitates the exchange of secret keys. Each QKD protocol is dissected to unveil its underlying mechanisms, providing a detailed exploration of the cryptographic procedures involved in generating and exchanging secure cryptographic keys.