Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

River Publishers eBooks

Post-quantum Cryptographic Approach for Cyberspace Security

J.J. Jayakanth, Vani Rajasekar, Velliangiri Sarveshwaran

Published Aug 23, 2024• 2 citations
Publisher

Abstract

The most recent quantum computers are capable of decoding secret encryption keys and opening up the network to attack by solving extremely difficult classical cryptography calculations. In contrast to the billions of years of calculation required by conventional computer equipment, they can nearly instantly solve complex mathematical calculations. The emergence of quantum computing and blockchains are two of the main technical developments both in academic and industry domains that are currently in progress. Researchers support the creation of innovative methods that incorporate encryption technology in the post-quantum computing. A lattice was utilized extensively in cryptography and those techniques were employed in both (a) cryptanalysis by utilizing lattice assumption to crack cryptosystems and (b) cryptography by exploiting challenging lattice problems in computational domain. The issues similar to the quantum attack and the execution of post-quantum signature verification in blockchains are a required scientific implementation in today’s world because blockchains have considerably advanced in recent years and learned numerous applications in various fields with the assumption that they will significantly improve their security. This chapter offers the theoretical underpinnings for current research in post-quantum cryptography that aims to integrate safe cryptographic primitives into blockchain technology.

DOI
10.1201/9781003558118-9

Related papers

Emergence of Post Quantum Cryptography with the Support of Blockchain Technology

Akriti Kushwaha, Mohammad S. Obaidat, Anshika Pandey +2 more

Quantum computing is bound to transform computing on a large scale, but it is equally causing severe security issues to the current cryptographic systems. The established encryption algorithms such as RSA and Elliptic Curve Cryptography (ECC) may be uncovered as soon as large-scale quantum computers may come into reality. Due to that, scientists are giving keen interest to Post-Quantum Cryptography (PQC), a group of algorithms designed to remain secure in the presence of quantum attacks. This shift cannot be overlooked by blockchain technology, which has a strong dependence on the use of cryptography to maintain trust, security, and integrity of the data. This paper examines the applications of post-quantum cryptographic techniques in blockchain networks, and how these techniques can be employed to enhance security against threats in the future. The paper investigates some of the PQC techniques, such as lattice-based, hash-based, code-based and multivariate cryptography, to check if they are appropriate to be used in blockchains. It also discusses practical issues, particularly, speed of execution, memory requirements, scalability and difficulty of implementation. Finally, the paper discusses future improvements and research requirements to develop blockchain systems that are secure and practical quantum-resistant.

International Conference on Computer, Information and Telecommunication Systems•Jul 1, 2026•0 citations

Applications of Post-Quantum Cryptography

Emils Bagirovs, Grigory Provodin, Tuomo Sipola +1 more

With the constantly advancing capabilities of quantum computers, conventional cryptographic systems relying on complex math problems may encounter unforeseen vulnerabilities. Unlike regular computers, which are often deemed cost-ineffective in cryptographic attacks, quantum computers have a significant advantage in calculation speed. This distinction potentially makes currently used algorithms less secure or even completely vulnerable, compelling the exploration of post-quantum cryptography (PQC) as the most reasonable solution to quantum threats. This review aims to provide current information on applications, benefits, and challenges associated with the PQC. The review employs a systematic scoping review with the scope restricted to the years 2022 and 2023; only articles that were published in scientific journals were used in this paper. The review examined the articles on the applications of quantum computing in various spheres. However, the scope of this paper was restricted to the domain of the PQC because most of the analyzed articles featured this field. Subsequently, the paper is analyzing various PQC algorithms, including lattice-based, hash-based, code-based, multivariate polynomial, and isogeny-based cryptography. Each algorithm is being judged based on its potential applications, robustness, and challenges. All the analyzed algorithms are promising for the post-quantum era in such applications as digital signatures, communication channels, and IoT. Moreover, some of the algorithms are already implemented in the spheres of banking transactions, communication, and intellectual property. Meanwhile, despite their potential, these algorithms face serious challenges since they lack standardization, require vast amounts of storage and computation power, and might have unknown vulnerabilities that can be discovered only with years of cryptanalysis. This overview aims to give a basic understanding of the current state of post-quantum cryptography with its applications and challenges. As the world enters the quantum era, this review not only shows the need for strong security methods that can resist quantum attacks but also presents an optimistic outlook on the future of secure communications, guided by advancements in quantum technology. By bridging the gap between theoretical research and practical implementation, this paper aims to inspire further innovation and collaboration in the field.

arXiv:2406.13258•European Conference on Cyber Warfare and Security•Jun 21, 2024•32 citations

Cryptographic Protocols Resilient to Quantum Attacks: Advancements in Post-Quantum Cryptography

Pallavi Niraj Vithalkar

New developments in quantum computing have made people worry that current security methods could be broken by quantum attacks. Some mathematical problems are hard to solve, which is how traditional encryption methods like RSA and ECC keep their secrets safe. However, quantum computers might be able to solve these issues a lot faster than regular computers, which makes these methods less safe. Because of this threat, experts have been working hard to make post-quantum cryptography methods that quantum computers can't break. These methods are made to stand up to the strength of quantum algorithms and protect the privacy, integrity, and validity of private data even when quantum attackers are present. Lattice-based cryptography is a potential method for post-quantum encryption. Its security comes from the difficulty of certain lattice problems. Lattice-based methods are thought to be safe from threats from both traditional and quantum computers because they offer good security promises. Lattice-based cryptography is a flexible way to build different types of cryptographic primitives, like encryption, digital signatures, and key sharing protocols. The study of code-based cryptography, which is based on how hard it is to decode some error-correcting codes, is another important advance. Code-based methods have been around for a long time and have been studied a lot, which makes them a good choice for security after quantum computing. Code-based cryptography is also easy to use and has strong security features, which makes it a good choice for real-world situations. Multivariate polynomial cryptography is another possible choice for cryptography after quantum computing. The safety of this method depends on how hard it is to solve systems of multivariate polynomial problems. Multivariate polynomial methods might not be as secure as lattice-based or code-based cryptography, but they are interesting options for some situations and places with limited resources.

Communications on Applied Nonlinear Analysis•Jun 23, 2024•6 citations

Post-Quantum Cryptography: Preparing for the Quantum Computing Era

Dr. Raj Kumar Garg

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.

•Aug 12, 2026•0 citations

Beyond Classical Limits

Divyajyothi M. G, Rachappa Jopate, B. Sundaravadivazhagan

As we enter the era of quantum computing, traditional cryptographic algorithms are becoming increasingly vulnerable to attacks that could compromise sensitive information. The idea of quantum physics, which enables far more efficient computation than classical computing, is what makes quantum computing possible. Although this holds great potential to transform industries like financial modeling, medicine development, and weather forecasting, it also poses a serious threat to the security of our digital infrastructure. Many of the cryptographic approaches used today rely on the difficulty of factoring large numbers or solving discrete logarithm problems. Quantum computers can perform numerous tasks far more quickly than classical computers, even if many of these methods are subject to attacks. Fortunately, post-quantum cryptography offers a possible remedy for this problem. It creates novel encryption algorithms that are immune to quantum attacks by using mathematical riddles that are believed to be difficult even for quantum computers to solve. Despite being relatively new, this field of study has the potential to transform the field of cryptography and protect our digital future. This chapter delves at the potential of post-quantum cryptography to transform the way we safeguard our digital environment. We examine the fundamental ideas and ideas in mathematics that underpin post-quantum cryptography. One of the most exciting areas of post-quantum cryptography is lattice-based cryptography. Mathematical structures called lattices have the appearance of well-organized spatial point grids. Lattice-based encryption is based on the problem of finding a short vector in a lattice, which is believed to be tough even for quantum computers. This is the basis for many post-quantum cryptography approaches. Code-based cryptography is another fascinating field of post-quantum encryption. Error-correcting codes, which are widely used in digital communication to ensure proper information delivery, constitute the foundation of this approach. Code-based cryptography relies on the difficulty of decoding a random linear code, which is believed to be resistant to quantum attacks. The primary drawback of this strategy is the huge key sizes needed, which may render it unfeasible for various applications. Another promising field of post-quantum cryptography is multivariate cryptography. Compared to other post-quantum cryptographic methods, multivariate cryptography offers the advantage of smaller key sizes, which makes it more useful in specific applications. We examine the strengths and weaknesses of these cutting-edge methods and highlight some of the challenges and limitations that must be addressed in order to fully realize the potential of post-quantum cryptography, such as the need for efficient implementation, standardization, and integration with existing systems. Although post-quantum cryptography appears to offer a viable safeguard against the risks associated with quantum computing, several challenges need to be tackled before its full potential can be achieved. One of the main challenges is standardization, which is necessary for the broad application of post-quantum cryptography methods. We also look at the real-world uses of post-quantum cryptography, such as online banking and encrypted texting. This chapter offers a thorough introduction to this fascinating area and highlights the creative solutions that are opening the door to a more secure digital future.

Wiley eBooks•Mar 7, 2025•0 citations

Quantum Computing and Cryptography: Security Challenges and Post-Quantum Solutions

Alok Priyadarshi, Raushan Kumar, Kumar Soumya +2 more

Quantum computing is rapidly emerging as a trans-formative technology with the potential to solve certain computational problems much faster than classical computers. While this advancement offers significant opportunities in science and technology, it also raises serious concerns for modern crypto-graphic systems. Widely used encryption methods such as RSA and Elliptic Curve Cryptography (ECC) rely on mathematical problems that are difficult for classical computers to solve but may become vulnerable to powerful quantum algorithms such as Shor’s and Grover’s algorithms. This paper examines the impact of quantum computing on existing cryptographic techniques and discusses the need for quantum-resistant security solutions. Various post-quantum cryptographic approaches, including lattice-based, hash-based, code-based, and multivariate cryptographic systems, are reviewed and compared in terms of security, performance, and practical implementation. The study also explores the strengths and limitations of these approaches and evaluates their suitability for future digital security requirements. In addition, the paper highlights the importance of hybrid cryptographic systems that combine classical and post-quantum methods. Such systems can support a gradual transition to quantum-resistant security while maintaining compatibility with existing infrastructure. Although post-quantum cryptography offers promising protection against future quantum threats, challenges such as increased computational requirements, larger key sizes, and implementation complexity remain important considerations. The findings emphasize the need for continued research, standardization, and strategic planning to ensure a secure transition to the post-quantum era. As quantum computing technology continues to advance, the adoption of reliable quantum-resistant cryptographic solutions will be essential for protecting digital communications, sensitive information, and critical infrastructure.

International Conference on Secure Information Systems and Technologies (ICSIST)•Aug 1, 2026•0 citations
The most recent quantum computers are capable of decoding secret encryption keys and opening up the network to attack by solving extremely difficult classical cryptography calculations. In contrast to the billions of years of calculation required by conventional computer equipment, they can nearly instantly solve complex mathematical calculations. The emergence of quantum computing and blockchains are two of the main technical developments both in academic and industry domains that are currently in progress. Researchers support the creation of innovative methods that incorporate encryption technology in the post-quantum computing. A lattice was utilized extensively in cryptography and those techniques were employed in both (a) cryptanalysis by utilizing lattice assumption to crack cryptosystems and (b) cryptography by exploiting challenging lattice problems in computational domain. The issues similar to the quantum attack and the execution of post-quantum signature verification in blockchains are a required scientific implementation in today’s world because blockchains have considerably advanced in recent years and learned numerous applications in various fields with the assumption that they will significantly improve their security. This chapter offers the theoretical underpinnings for current research in post-quantum cryptography that aims to integrate safe cryptographic primitives into blockchain technology.
Quantum computing is bound to transform computing on a large scale, but it is equally causing severe security issues to the current cryptographic systems. The established encryption algorithms such as RSA and Elliptic Curve Cryptography (ECC) may be uncovered as soon as large-scale quantum computers may come into reality. Due to that, scientists are giving keen interest to Post-Quantum Cryptography (PQC), a group of algorithms designed to remain secure in the presence of quantum attacks. This shift cannot be overlooked by blockchain technology, which has a strong dependence on the use of cryptography to maintain trust, security, and integrity of the data. This paper examines the applications of post-quantum cryptographic techniques in blockchain networks, and how these techniques can be employed to enhance security against threats in the future. The paper investigates some of the PQC techniques, such as lattice-based, hash-based, code-based and multivariate cryptography, to check if they are appropriate to be used in blockchains. It also discusses practical issues, particularly, speed of execution, memory requirements, scalability and difficulty of implementation. Finally, the paper discusses future improvements and research requirements to develop blockchain systems that are secure and practical quantum-resistant.
With the constantly advancing capabilities of quantum computers, conventional cryptographic systems relying on complex math problems may encounter unforeseen vulnerabilities. Unlike regular computers, which are often deemed cost-ineffective in cryptographic attacks, quantum computers have a significant advantage in calculation speed. This distinction potentially makes currently used algorithms less secure or even completely vulnerable, compelling the exploration of post-quantum cryptography (PQC) as the most reasonable solution to quantum threats. This review aims to provide current information on applications, benefits, and challenges associated with the PQC. The review employs a systematic scoping review with the scope restricted to the years 2022 and 2023; only articles that were published in scientific journals were used in this paper. The review examined the articles on the applications of quantum computing in various spheres. However, the scope of this paper was restricted to the domain of the PQC because most of the analyzed articles featured this field. Subsequently, the paper is analyzing various PQC algorithms, including lattice-based, hash-based, code-based, multivariate polynomial, and isogeny-based cryptography. Each algorithm is being judged based on its potential applications, robustness, and challenges. All the analyzed algorithms are promising for the post-quantum era in such applications as digital signatures, communication channels, and IoT. Moreover, some of the algorithms are already implemented in the spheres of banking transactions, communication, and intellectual property. Meanwhile, despite their potential, these algorithms face serious challenges since they lack standardization, require vast amounts of storage and computation power, and might have unknown vulnerabilities that can be discovered only with years of cryptanalysis. This overview aims to give a basic understanding of the current state of post-quantum cryptography with its applications and challenges. As the world enters the quantum era, this review not only shows the need for strong security methods that can resist quantum attacks but also presents an optimistic outlook on the future of secure communications, guided by advancements in quantum technology. By bridging the gap between theoretical research and practical implementation, this paper aims to inspire further innovation and collaboration in the field.
New developments in quantum computing have made people worry that current security methods could be broken by quantum attacks. Some mathematical problems are hard to solve, which is how traditional encryption methods like RSA and ECC keep their secrets safe. However, quantum computers might be able to solve these issues a lot faster than regular computers, which makes these methods less safe. Because of this threat, experts have been working hard to make post-quantum cryptography methods that quantum computers can't break. These methods are made to stand up to the strength of quantum algorithms and protect the privacy, integrity, and validity of private data even when quantum attackers are present. Lattice-based cryptography is a potential method for post-quantum encryption. Its security comes from the difficulty of certain lattice problems. Lattice-based methods are thought to be safe from threats from both traditional and quantum computers because they offer good security promises. Lattice-based cryptography is a flexible way to build different types of cryptographic primitives, like encryption, digital signatures, and key sharing protocols. The study of code-based cryptography, which is based on how hard it is to decode some error-correcting codes, is another important advance. Code-based methods have been around for a long time and have been studied a lot, which makes them a good choice for security after quantum computing. Code-based cryptography is also easy to use and has strong security features, which makes it a good choice for real-world situations. Multivariate polynomial cryptography is another possible choice for cryptography after quantum computing. The safety of this method depends on how hard it is to solve systems of multivariate polynomial problems. Multivariate polynomial methods might not be as secure as lattice-based or code-based cryptography, but they are interesting options for some situations and places with limited resources.
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.
As we enter the era of quantum computing, traditional cryptographic algorithms are becoming increasingly vulnerable to attacks that could compromise sensitive information. The idea of quantum physics, which enables far more efficient computation than classical computing, is what makes quantum computing possible. Although this holds great potential to transform industries like financial modeling, medicine development, and weather forecasting, it also poses a serious threat to the security of our digital infrastructure. Many of the cryptographic approaches used today rely on the difficulty of factoring large numbers or solving discrete logarithm problems. Quantum computers can perform numerous tasks far more quickly than classical computers, even if many of these methods are subject to attacks. Fortunately, post-quantum cryptography offers a possible remedy for this problem. It creates novel encryption algorithms that are immune to quantum attacks by using mathematical riddles that are believed to be difficult even for quantum computers to solve. Despite being relatively new, this field of study has the potential to transform the field of cryptography and protect our digital future. This chapter delves at the potential of post-quantum cryptography to transform the way we safeguard our digital environment. We examine the fundamental ideas and ideas in mathematics that underpin post-quantum cryptography. One of the most exciting areas of post-quantum cryptography is lattice-based cryptography. Mathematical structures called lattices have the appearance of well-organized spatial point grids. Lattice-based encryption is based on the problem of finding a short vector in a lattice, which is believed to be tough even for quantum computers. This is the basis for many post-quantum cryptography approaches. Code-based cryptography is another fascinating field of post-quantum encryption. Error-correcting codes, which are widely used in digital communication to ensure proper information delivery, constitute the foundation of this approach. Code-based cryptography relies on the difficulty of decoding a random linear code, which is believed to be resistant to quantum attacks. The primary drawback of this strategy is the huge key sizes needed, which may render it unfeasible for various applications. Another promising field of post-quantum cryptography is multivariate cryptography. Compared to other post-quantum cryptographic methods, multivariate cryptography offers the advantage of smaller key sizes, which makes it more useful in specific applications. We examine the strengths and weaknesses of these cutting-edge methods and highlight some of the challenges and limitations that must be addressed in order to fully realize the potential of post-quantum cryptography, such as the need for efficient implementation, standardization, and integration with existing systems. Although post-quantum cryptography appears to offer a viable safeguard against the risks associated with quantum computing, several challenges need to be tackled before its full potential can be achieved. One of the main challenges is standardization, which is necessary for the broad application of post-quantum cryptography methods. We also look at the real-world uses of post-quantum cryptography, such as online banking and encrypted texting. This chapter offers a thorough introduction to this fascinating area and highlights the creative solutions that are opening the door to a more secure digital future.
Quantum computing is rapidly emerging as a trans-formative technology with the potential to solve certain computational problems much faster than classical computers. While this advancement offers significant opportunities in science and technology, it also raises serious concerns for modern crypto-graphic systems. Widely used encryption methods such as RSA and Elliptic Curve Cryptography (ECC) rely on mathematical problems that are difficult for classical computers to solve but may become vulnerable to powerful quantum algorithms such as Shor’s and Grover’s algorithms. This paper examines the impact of quantum computing on existing cryptographic techniques and discusses the need for quantum-resistant security solutions. Various post-quantum cryptographic approaches, including lattice-based, hash-based, code-based, and multivariate cryptographic systems, are reviewed and compared in terms of security, performance, and practical implementation. The study also explores the strengths and limitations of these approaches and evaluates their suitability for future digital security requirements. In addition, the paper highlights the importance of hybrid cryptographic systems that combine classical and post-quantum methods. Such systems can support a gradual transition to quantum-resistant security while maintaining compatibility with existing infrastructure. Although post-quantum cryptography offers promising protection against future quantum threats, challenges such as increased computational requirements, larger key sizes, and implementation complexity remain important considerations. The findings emphasize the need for continued research, standardization, and strategic planning to ensure a secure transition to the post-quantum era. As quantum computing technology continues to advance, the adoption of reliable quantum-resistant cryptographic solutions will be essential for protecting digital communications, sensitive information, and critical infrastructure.