The history of cryptology can be broken down into eras, with the first being the paper and pencil era. The computers weren't limited to cryptanalysis; they were also used to encipher. In recent years, an increasing ability to manipulate quantum particles and DNA has led to new cryptologic techniques and new kinds of computers. Quantum cryptography offers an ability to detect someone eavesdropping on a line and, if it is free of such intrusions, securely exchange a key for use with a symmetric cipher, like AES. Traditional computers operate using bits that are either 0 or 1. The National Institute of Standards and Technology responded to the threat of quantum computers in its usual way.
The history of cryptology can be broken down into eras, with the first being the paper and pencil era. The computers weren't limited to cryptanalysis; they were also used to encipher. In recent years, an increasing ability to manipulate quantum particles and DNA has led to new cryptologic techniques and new kinds of computers. Quantum cryptography offers an ability to detect someone eavesdropping on a line and, if it is free of such intrusions, securely exchange a key for use with a symmetric cipher, like AES. Traditional computers operate using bits that are either 0 or 1. The National Institute of Standards and Technology responded to the threat of quantum computers in its usual way.
Cryptography has evolved alongside the development of communication and computing technologies, transitioning from simple manual techniques to complex quantum-resistant algorithms. This journey reflects humanity’s need to secure information in an increasingly interconnected world. The evolution of cryptographic methods highlights humanity’s continuous effort to protect privacy and secure communication. As the world transitions into the quantum era, cryptography must advance to meet the challenges posed by emerging technologies. During the early age, techniques such as Substitution and Transposition ciphers were used. In Substitution Cipher, letters in a message were replaced with other letters according to a fixed rule, and in Transposition Ciphers, the letters of a message were reordered to obscure its meaning. The limitations were that it was easily broken once the substitution or transposition rule was discovered. Subsequently, devices like Enigma machine used rotors for implementing complex substitution ciphers, and the breaking of the Enigma code by allied cryptanalysts marked a turning point in cryptography and cryptanalysis.
Privacy of information can be maintained using two cryptographic techniques i.e. symmetric key cryptography and asymmetric key cryptography. For securing data using symmetric key cryptography, Advanced Encryption Standard (AES) is one of the trusted cryptographic algorithms. AES is a block cipher based symmetric key cryptographic algorithm which can resist conventional computers as well as quantum computers. In recent years, many researches have been done that exploit the property of quantum mechanics to solve mathematical problems that are ever difficult for conventional computers. Many of the cryptographic algorithms can be broken if large scale quantum computers are ever made. This paper depicts the proof of AES-256 using Grover’s algorithm which can resist quantum. Keywords: AES,RSA, ECC, Quantum Key Distribution (QKD), Quantum bit commitment, Quantum Cryptography.
Cryptography has long been an essential tool in safeguarding digital communication and securing sensitive information. As technology has progressed, so has the complexity of the methods used to protect our data. In the wake of quantum computing's rise, traditional cryptographic systems face serious challenges, demanding a new understanding of how quantum algorithms could both undermine and enhance security. Chapter 1 deals with the Basics of Cryptography lays the groundwork by introducing classical cryptography, tracing its evolution from ancient ciphers to modern cryptosystems. In Chapter 2, readers are introduced to Quantum Algorithms, the principles of quantum mechanics relevant to computing, including qubits, superposition, and entanglement. The Chapter 3 focuses on Shor’s algorithm, a landmark quantum algorithm that threatens the security of widely used public-key cryptosystems like RSA and ECC. In Chapter 4 Grover’s Algorithm is examined in the context of brute-force attacks on symmetric key cryptography. Chapter 5 focusing on Simon’s Algorithm and its role in breaking cryptographic primitives through structure exploitation. In Chapter 6 a broader discussion about Cryptographic Implications of Quantum Computing is given on how quantum computing affects modern cryptographic systems. Finally, in Chapter 7, the future of cryptography in the quantum era is discussed.
In the last few years the world in which Quantum Cryptography evolves has deeply changed. On the one side the revelations of Snowden, though he said nothing really new, made the world more aware of the importance to protect sensitive data from all kinds of adversaries, including sometimes "friends." On the other side, breakthroughs in quantum computation, in particular in superconducting qubits and surface-codes, made it possible that in 15 to 25 years there might be a quantum machine able to break today's codes. This implies that in order to protect today's data over a few decades, one has to act now and use some quantum-safe cryptography.
Classical cryptography has been around for a long time in the documented human history, but most classical ciphers were broken and even solved by hand. Shannon introduced the notion of perfect secrecy that formally defines confidentiality in the information-theoretic sense, which is only possible in the restricted scenarios where the message is no longer than the encryption key. The invention of public-key cryptography (the Diffie-Hellman key exchange protocol in 1976 and the RSA crypto-system in 1977) marks the birth of modern cryptography, allowing parties to exchange messages securely without sharing any secrets in advance. Furthermore, it provides computational security based on the conjectured hardness of mathematical problems such as factorization and the discrete logarithm. Public-key cryptography has found numerous applications in the Internet, financial and banking industry, and blockchains, and it plays a crucial role in protecting information security and asset safety. Unfortunately, in the 1990s, Shor proposed efficient quantum algorithms that solve number-theoretic problems, including factorization and discrete logarithms in polynomial time. Once a quantum computer of a particular scale becomes a reality, it will cause a devastating blow to the existing public-key infrastructure. To deal with such a ‘quantum crisis’, academia and industry are looking into the design, analysis and standardization of cryptographic algorithms that can resist quantum computers referred to as post-quantum cryptography (PQC). The National Institute of Standards and Technology (NIST) has been soliciting proposals for the post-quantum public-key algorithms since 2016. More recently, the Chinese Association for Cryptologic Research (CACR) held a competition on designing cryptographic algorithms whose public-key cryptography track focused on post-quantum cryptographic algorithms. Lattice-based cryptography is considered by most to be the mainstream technical route of post-quantum cryptography, which is reflected in the number of proposals (and their percentage of the total) received in the NIST PQC process. To reflect the status quo of post-quantum cryptography, we invite leading experts in this area to contribute three technical perspectives that aim to help readers understand the algorithms, the underlying basic techniques and different technical routes to achieve quantum resistance. The first perspective, presented by Lu and Zhang, introduces public-key cryptographic algorithms whose quantum security is reducible from the conjectured quantum hardness of lattice problems. In particular, they mainly focus on public-key encryption (PKE) and the key encapsulation mechanism (KEM), which are essential building blocks for securing the confidentiality of communication without pre-shared secrets. Both types of crypto-systems are solicited by the NIST PQC standardization and the CACR algorithm design competition. This perspective gives a comprehensive survey on practical lattice-based PKEs/KEMs, and their best-known quantum and classical attacks. Another important post-quantum crypto-system is digital signature, which ensures that three goals of information security are met other than confidentiality, namely, integrity, authentication and non-repudiation. The second perspective is on lattice-based signature by Lyubashevsky. In this perspective, he surveys different techniques in building lattice-based post-quantum crypto-systems, discusses the challenges in overcoming performance issues and gives us state-of-the-art digital signature schemes. In addition to ensuring the ‘static’ security of information in storage and transmission, advanced cryptographic algorithms and protocols can guarantee information security during the computation process (possibly among multiple parties), referred to as privacy-preserving computation. Cryptographic techniques involved in privacy-preserving computation include secure multi-party computation, zero-knowledge proof and fully homomorphic encryption. There is a pressing need to migrate them to the post-quantum era. The third perspective, by Yu and Xie, presents practical instantiations of these algorithms and discusses possible ways to migrate them to their quantum-resistant counterparts. To summarize, post-quantum cryptography has received widespread attention and made significant progress in recent years. Some post-quantum cryptographic algorithms, such as the lattice-based candidate, also have other advantages (e.g., computational efficiency and full homomorphism) over their classical counterparts. Lattice-based cryptography is an emerging field with high theoretical value and wide application, and we encourage young researchers to enter and explore this new and exciting field.
This study aims to increase security during the transition period against the threats posed by quantum computers to existing cryptographic systems. Since it will take time for post-quantum cryptography standards to become fully applicable, especially asymmetric encryption methods face serious security risks. In this context, a hybrid encryption method that is more resistant to quantum computer attacks is proposed in the study. The proposed method aims to increase the security of asymmetric algorithms by using pre-shared symmetric key (PSK). In this approach, key distribution is made secure by using symmetric encryption algorithms resistant to quantum attacks such as AES-256. Thus, existing systems gain temporary protection against quantum threats and the transition process is managed more securely. This study examines the integration of symmetric and asymmetric encryption methods, evaluating the performance and potential security risks of the hybrid approach. It is aimed that the proposed method will contribute to the modernization of national and international cryptographic infrastructure and provide a critical Intermediate solution in the transition process to the post-quantum era.