This chapter describes the impact of quantum algorithms on the schemes used today, and offers a glimpse of some schemes offering plausible post-quantum security. It introduces one computational problem that has received a lot of attention, and is widely believed to be hard even for quantum algorithms. Quantum cryptography refers to cryptosystems that are implemented using quantum computers, quantum-mechanical phenomena, and quantum communication channels; for this reason, they would be difficult to deploy widely over the existing Internet. Post-quantum cryptosystems, are entirely classical—but are intended to ensure security even if an attacker has access to a quantum computer. The chain-based signature scheme is a stateful signature scheme that is existentially unforgeable under an adaptive chosen-message attack. Quantum computing is covered in the text by Nielsen and Chuang, which also describes Grover’s algorithm and Shor’s algorithm.
This chapter describes the impact of quantum algorithms on the schemes used today, and offers a glimpse of some schemes offering plausible post-quantum security. It introduces one computational problem that has received a lot of attention, and is widely believed to be hard even for quantum algorithms. Quantum cryptography refers to cryptosystems that are implemented using quantum computers, quantum-mechanical phenomena, and quantum communication channels; for this reason, they would be difficult to deploy widely over the existing Internet. Post-quantum cryptosystems, are entirely classical—but are intended to ensure security even if an attacker has access to a quantum computer. The chain-based signature scheme is a stateful signature scheme that is existentially unforgeable under an adaptive chosen-message attack. Quantum computing is covered in the text by Nielsen and Chuang, which also describes Grover’s algorithm and Shor’s algorithm.
Abstract It is viewed as revolutionary technology, offering incredible potential in terms of computing power within different scientific and industrial sectors. Quantum computers provide remarkable computing power; however, they also present significant security risks to existing public-key cryptography systems used to secure digital communication, online banking systems, government, medical applications, cloud computing systems, and IoT systems. Security of commonly used encryption schemes like RSA, DH, and ECC depends on mathematical problems that are impossible for classical computers to solve but can be easily resolved with the help of powerful enough quantum computers by using Shor’s algorithm. Furthermore, Grover’s algorithm makes exhaustive search attacks much faster, thus effectively lowering the security level of symmetric encryption schemes since it provides the speed-up for brute-force attacks. Post-Quantum Cryptography (PQC) turned out to be an effective and scalable method to protect digital data from attacks using quantum computing. In contrast to quantum cryptography, which requires a special quantum communication channel, PQC uses classical cryptographic algorithms that cannot be broken down by either classical or quantum computer due to certain mathematical problems. This research paper offers an extensive exploration of post-quantum cryptography through the analysis of the development of quantum computing, weaknesses of current cryptographic techniques, and mathematics behind quantum-resistant algorithms. Moreover, this paper explores the major classes of PQC techniques such as lattice-based, code-based, hash-based, multivariate, and isogeny-based cryptography and provides details about their security and application. Moreover, the report gives an overview of the NIST Post-Quantum Cryptography Standardization Project and analyzes recent standardizations of quantum-proof algorithms to be utilized in future digital infrastructures. Keywords: Post-Quantum Encryption, Quantum Security, Quantum-Proof Public-Key Cryptography, Lattice-Based Security Protocols, ML-KEM Key Encapsulation Mechanism, ML-DSA Digital Signature Algorithm, NIST Post-Quantum Cryptography, Contemporary Cybersecurity, Secure Communications, Cryptographic Algorithms.
Quantum-resistant blockchains refer to cryptographic processes that are resistant to attacks via quantum computers. Present public-key algorithms depend on the difficulty of deciphering the discrete log and factorization problem of large prime numbers. Shor's algorithm can be used to break the hash signatures by quantum computers. Therefore, it is necessary for the development of a post-quantum secure signature scheme or quantum-resistant blockchain for post-quantum blockchain security. This chapter will discuss the impact quantum computers are predicted to have on public key cryptography based on the following topics: quantum computers, public key cryptography, quantum threat to PKI, Shor's and Grover's algorithms, post-quantum cryptography, and quantum-resistant blockchain.
Currently on the precipice of a quantum age, the field of cryptography faces unprecedented challenges and opportunities. This chapter explores recent trends in both quantum and post-quantum cryptography, examining how advancements in quantum computing threaten existing cryptographic standards and iterates the requirement for creation of novel algorithms that are resistant to quantum attacks. A summary of algorithms requiring quantum hardware, such as Grover's and Shor's, that jeopardizes cryptography schemes like RSA and ECC has been provided. The standardization efforts in post-quantum cryptography, with particular attention on prominent candidate algorithms such as lattice-based cryptosystems, code-based cryptosystems, hash-based multivariate quadratic equations, and so on has been explored. Approaches which blend classical and post-quantum algorithms, are also covered. This chapter aims to provide a comprehensive understanding of quantum and post-quantum cryptography, highlighting the urgent need for adaptation and innovation in protecting us against the imminent quantum threat.
Quantum computing is a transformational technology once implemented, capable of addressing problems far beyond the capacity of classical computers. But this progress is also a real challenge to the core of today's modern security. Traditional cryptographic algorithms, such as those based on RSA, ECC, and Diffie-Hellman key exchange, are based on the computational hardness of problems such as prime factorization and discrete logarithms that quantum algorithms solve in polynomial time. As a particular research interesting example, with Shor's Algorithm one can factorize large numbers efficiently, rendering insecure the majority of public key cryptosystems used nowadays. This urgently demands a reevaluation of existing encryption schemes in the context of a post-quantum world. In this paper, we take a closer look at the threats that quantum computers pose to classical security infrastructure including encryption scheme and explore the impact that quantum computation can have on current cryptographic schemes. It calculates the cost in terms of symmetric and asymmetric security, accounting for effects of both Shor's and Grover's algorithms. Symmetric key systems such as AES are also harder hit—Grover's algorithm can give only a quadratic speedup here—but they do need to double key sizes for a sufficient level of post-quantum security. In reaction to those threats, the paper investigates nextgeneration post-quantum cryptographic (PQC) solutions resistant to quantum cryptanalysis. Lattice-based cryptosystems, hash-based signature schemes, multivariate polynomial systems, and code-based cryptosystems are some of the candidates that are being considered in international standardization work, including especially at NIST. In this paper, we compare those alternatives for security, performance, scalability, and feasibility of implementation in real system. An important aspect of this contribution is a comparative study of traditional and post-quantum cryptographic protocols in the context of a number of cybersecurity applications, including secure communications, blockchain networks and IoT contexts. It also covers the quantum readiness timeline and transitional issues, such as backward compatibility, standardization lag and the associated increased computational overhead. Through a mitigated risk evaluation and cryptanalytic attack simulation based on quantum-inspired algorithms, this analysis emphasizes the need to prepare ourselves against quantum-induced security issues. It provides strategic guidance to organizations as they plan for the post-quantum future, stressing cryptographic agility, hybrid encryption models and real-time threat monitoring. Ultimately, the results of this work add to the worldwide conversation on establishing secure systems within the digital age of quantum computing and recommend proactive migration plans for the integrity, confidentiality, and trust one should have in the future cyber world.
The boom of quantum computing has brought both benefits and threats to cyber-physical systems. The primary purpose of the paper is to highlight the possible threats by quantum computers, and to provide a comparative study of the on-going quantum-resistant post-quantum cryptography suitable for current network infrastructure. Asymmetric key cryptography, mainly the widely adopted RSA and ECC algorithms, has been compromised by quantum algorithms such as the Shor’s algorithm. Moreover, symmetric algorithms such as AES are weakened by brute force attacks using Grover’s algorithm. Thus, researchers are developing public key algorithms based on hard mathematical models that provide resistance against quantum attacks and can be deployed in classical hardware. We categorize the well-known post-quantum schemes based on (1) their security goals: confidentiality and integrity, and (2) their mathematical problems: code-based, lattice-based, super-singular elliptic curve isogeny based, multivariate and hash-based algorithm. Hash-based post- quantum cryptography is further categorized into two: stateless and stateful signature scheme. Furthermore, the chapter compares the algorithms based on the key sizes, ciphertext sizes, signature sizes, computation, and time cost. The paper also presents the challenges faced by the post-quantum algorithms, and it outlines directions for further research to improve the algorithms. Moreover, various cyber-physical fields, including industrial control systems, mainly nuclear power plants, water management plants, and even space stations and their infrastructure, rely on classical cryptography. Thus, the paper presents a generic hybrid cryptosystem based on classical and post-quantum cryptography to enhance resistance against classical and quantum attacks.
The current hype of quantum computing has necessitated the need for computer security stakeholders to call for the design of security algorithms that will be quantum efficient when quantum computers finally grace our computing sphere. Recent advancements in quantum computing have made cryptographic schemes more vulnerable to quantum attacks like Shor's algorithm and Grove's algorithm. Therefore NIST call for a new set of algorithms known as Post-Quantum cryptography that would be quantum proof is imminent. Many Post quantum algorithms have been designed and tested. But only few of them made it to the round 3 (the final round). This paper reviewed these post quantum candidates. Literatures highlighting their scheme, properties, implementation and areas of security coverage was reviewed. Recommendations on future research areas in this field was itemized for this novel security paradigm as we await the final standardization of this cryptosystems. 1.0. INTRODUCTION Cryptography can be referred to as the science of information hiding. When information is on transit from point A to Point B, it can be intercepted but when intercepted, the intruder is unable to understand the information. The intended recipient is the only one that can deci pher the message using a key [1]. Post Quantum cryptography is the application of existing cryptographic algorithms or the design of new algorithms that are quantum proof [2]. The marriage of quantum theory in physics with computer science is known as quan tum computing. Instead of bits, quantum computers use qubits. Unlike traditional computers, they do not use the two-state position of 0s and 1s. Quantum computers encode data using a four-state superimposition. On data processing devices, the four states o f quantum computer qubits are represented as ions, atoms, photons, or electrons. Because of its ability to represent data in multiple states, a quantum computer will presumably be more powerful than even the most powerful supercomputer [3]. For some times now, quantum computers-machines that use quantum mechanical concepts to solve mathematical problems that are complicated or impossible for normal computers-have gotten a lot of press. If quantum computers are ever mass produced, many of the current public-key cryptosystems will be broken [4]. The security and privacy of electroni c communications on the Internet and elsewhere will be compromised as a result. This will not be funny when it eventually happens. To this effect, The objective of post-quantum cryptography