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

Wiley eBooks

Developments in Post‐Quantum Cryptography

Srijita Sarkar, Saranya Santhosh Kumar, Anaranya Bose, Tiyash Mukherjee

Published Jul 17, 2023• 0 citations
Publisher

Abstract

Cryptography deals with the design of mechanisms based on mathematical algorithms that provide fundamental information security services for computers and communication systems. Modern-day cryptography makes use of binary bit sequences and relies on publicly known algorithms such as number theory, computational complexity theory, and probability theory that are practically impossible for conventional computers to compute. Quantum computers use quantum bits or Qubits and can get us “a quantum speedup,” which will take seconds to solve these complex computations. This quantum supremacy, which scientists hope to attain by the next two decades, would pose a serious threat to the existing cryptographic systems. The main algorithms that have been proposed for post-quantum primitives are based on lattices, multivariate polynomials, codes, hash functions, supersingular elliptical curves and so on. This paper focuses on the developments that have so far been made in the field of post-quantum cryptography and its future prospects.

DOI
10.1002/9781119879831.ch5

Related papers

CRYPTOGRAPHIC SECURITY IN THE ERA OF QUANTUM COMPUTERS: THE CONCEPT AND DEVELOPMENT PROSPECTS OF POST-QUANTUM CRYPTOGRAPHY

Dilnoz Muhamediyeva, Farhad Tagaev

This article analyzes the threats to the security of modern cryptographic systems posed by the development of quantum computers, as well as the emergence of the concept of post-quantum cryptography as a solution to these problems. The study demonstrates that classical public-key cryptosystems, particularly RSA, DSA, and elliptic curve-based algorithms, can be broken using quantum algorithms. At the same time, new cryptographic systems based on hash functions, codes, lattices, and multivariate quadratic equations are considered a promising direction. The main challenges related to the efficiency, reliability, and applicability of post-quantum cryptography are also highlighted. As a result, the necessity of developing new cryptographic standards to ensure future information security is demonstrated.

•May 3, 2026•0 citations

Enhancing Secure Communication System Using Post-Quantum Cryptography

G. Ramalakshmi, T. Vijayalakshmi

In modern computer networks, cryptography is vital for preserving privacy, protecting sensitive information, and securing online communication. The mathematical problems that conventional encryption algorithms such as RSA and ECC depend on are tough for standard computers to tackle. Nonetheless, these traditional methods could be vulnerable to quantum assaults due to the rapid advancement of quantum computing. Post-quantum cryptography (PQC) refers to cryptographic methods designed to be secure against both classical and quantum computers. These algorithms rely on mathematical challenges believed to be resistant to quantum attacks, such as multivariate polynomial, hash, lattice, and code-based problems. This paper examines the necessity for post-quantum cryptography, the weaknesses of existing cryptographic systems, and the various categories of post-quantum algorithms.

•Jul 15, 2026•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

Quantum and Post‐Quantum Cryptography

Om Pal, Manoj Kumar Jain, B.K. Murthy +1 more

Broadly, Cryptography refers to the passing of secret information from one place to another securely so that only intended receivers can decrypt it. Security of the modern public key cryptographic algorithms and protocols is mainly dependent on the complexity of the factorization of the product of large prime numbers. But due to technological developments in the field of computation and evolution of new mathematical techniques, the problem of the factorization of the product of integers is not complex anymore nowadays. The growing research interests in Quantum computing technology is also making the modern public cryptographic algorithms unsafe. Researchers have proved that modern cryptographic algorithms such as RSA are breakable using quantum computers in polynomial time complexity. Therefore, attempts are being made to design new cryptographic algorithms using Quantum Computing techniques. Quantum cryptography is an emerging field which works on principles of quantum physics. In this paper, an attempt has been made to introduce quantum cryptography, analysis on supremacy of quantum cryptography over modern cryptography, discussion on key distribution using quantum physics, and implementation challenges in quantum key distribution. We have proposed two key verification mechanisms for BB84 protocol, analysis on quantum attacks on modern cryptographic digital signatures, Post-quantum digital signatures and finally discussion on future directions of this technology.

Wiley eBooks•Jan 14, 2022•8 citations

Post-Quantum Cryptography: Designing Secure Cryptographic Systems to Withstand the Threat of Quantum Computing Attacks

Eren Danyel Uçar

The emergence of quantum computing poses a serious threat to traditional communication systems, endangering the security of digital communications and critical infrastructure. Although existing cryptographic algorithms (such as RSA and ECC) rely on the inefficiency of computing large numbers or solving logarithm inequality problems, quantum algorithms (especially Shor's algorithm) can solve these problems efficiently. To mitigate this threat, the field of post-quantum cryptography (PQC) has emerged and focuses on developing cryptographic systems that are resilient to quantum attacks. The main techniques in PQC include lattice-based, hash-based, code-based, and multivariate polynomial cryptography. Lattice-based cryptography is the leading contender, providing high security and supporting good properties such as fully homomorphic encryption, but facing issues related to size and computational efficiency. Hash-based encryption enables strong digital signatures but has limitations. Code-based encryption based on error-correcting codes provides proof of security but requires small size. Multivariate polynomial cryptography has good performance but has drawbacks in some applications. While standardization efforts led by organizations such as NIST continue, PQC is at the forefront of protecting the digital future from the impact of quantum computing, ensuring the integrity and confidentiality of information in the post-quantum era.

Human computer interaction.•Nov 29, 2024•0 citations

Post-Quantum Cryptography: Preparing for the Quantum Threat

Shashikala Gurpur

Post-quantum cryptography is essential for safeguarding digital communications against the emerging threat posed by quantum computers, which can potentially break traditional cryptographic algorithms. This paper explores the vulnerabilities of current cryptographic systems to quantum attacks and examines the development of post-quantum algorithms designed to resist such threats. We analyze various candidate cryptographic schemes, including lattice-based, code-based, and multivariate polynomial cryptography, highlighting their theoretical foundations and practical implementations. Additionally, the paper discusses the challenges of transitioning to post-quantum standards, including key management and integration with existing systems.

Computer Fraud & Security•Dec 21, 2024•4 citations
Cryptography deals with the design of mechanisms based on mathematical algorithms that provide fundamental information security services for computers and communication systems. Modern-day cryptography makes use of binary bit sequences and relies on publicly known algorithms such as number theory, computational complexity theory, and probability theory that are practically impossible for conventional computers to compute. Quantum computers use quantum bits or Qubits and can get us “a quantum speedup,” which will take seconds to solve these complex computations. This quantum supremacy, which scientists hope to attain by the next two decades, would pose a serious threat to the existing cryptographic systems. The main algorithms that have been proposed for post-quantum primitives are based on lattices, multivariate polynomials, codes, hash functions, supersingular elliptical curves and so on. This paper focuses on the developments that have so far been made in the field of post-quantum cryptography and its future prospects.
This article analyzes the threats to the security of modern cryptographic systems posed by the development of quantum computers, as well as the emergence of the concept of post-quantum cryptography as a solution to these problems. The study demonstrates that classical public-key cryptosystems, particularly RSA, DSA, and elliptic curve-based algorithms, can be broken using quantum algorithms. At the same time, new cryptographic systems based on hash functions, codes, lattices, and multivariate quadratic equations are considered a promising direction. The main challenges related to the efficiency, reliability, and applicability of post-quantum cryptography are also highlighted. As a result, the necessity of developing new cryptographic standards to ensure future information security is demonstrated.
In modern computer networks, cryptography is vital for preserving privacy, protecting sensitive information, and securing online communication. The mathematical problems that conventional encryption algorithms such as RSA and ECC depend on are tough for standard computers to tackle. Nonetheless, these traditional methods could be vulnerable to quantum assaults due to the rapid advancement of quantum computing. Post-quantum cryptography (PQC) refers to cryptographic methods designed to be secure against both classical and quantum computers. These algorithms rely on mathematical challenges believed to be resistant to quantum attacks, such as multivariate polynomial, hash, lattice, and code-based problems. This paper examines the necessity for post-quantum cryptography, the weaknesses of existing cryptographic systems, and the various categories of post-quantum algorithms.
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.
Broadly, Cryptography refers to the passing of secret information from one place to another securely so that only intended receivers can decrypt it. Security of the modern public key cryptographic algorithms and protocols is mainly dependent on the complexity of the factorization of the product of large prime numbers. But due to technological developments in the field of computation and evolution of new mathematical techniques, the problem of the factorization of the product of integers is not complex anymore nowadays. The growing research interests in Quantum computing technology is also making the modern public cryptographic algorithms unsafe. Researchers have proved that modern cryptographic algorithms such as RSA are breakable using quantum computers in polynomial time complexity. Therefore, attempts are being made to design new cryptographic algorithms using Quantum Computing techniques. Quantum cryptography is an emerging field which works on principles of quantum physics. In this paper, an attempt has been made to introduce quantum cryptography, analysis on supremacy of quantum cryptography over modern cryptography, discussion on key distribution using quantum physics, and implementation challenges in quantum key distribution. We have proposed two key verification mechanisms for BB84 protocol, analysis on quantum attacks on modern cryptographic digital signatures, Post-quantum digital signatures and finally discussion on future directions of this technology.
The emergence of quantum computing poses a serious threat to traditional communication systems, endangering the security of digital communications and critical infrastructure. Although existing cryptographic algorithms (such as RSA and ECC) rely on the inefficiency of computing large numbers or solving logarithm inequality problems, quantum algorithms (especially Shor's algorithm) can solve these problems efficiently. To mitigate this threat, the field of post-quantum cryptography (PQC) has emerged and focuses on developing cryptographic systems that are resilient to quantum attacks. The main techniques in PQC include lattice-based, hash-based, code-based, and multivariate polynomial cryptography. Lattice-based cryptography is the leading contender, providing high security and supporting good properties such as fully homomorphic encryption, but facing issues related to size and computational efficiency. Hash-based encryption enables strong digital signatures but has limitations. Code-based encryption based on error-correcting codes provides proof of security but requires small size. Multivariate polynomial cryptography has good performance but has drawbacks in some applications. While standardization efforts led by organizations such as NIST continue, PQC is at the forefront of protecting the digital future from the impact of quantum computing, ensuring the integrity and confidentiality of information in the post-quantum era.
Post-quantum cryptography is essential for safeguarding digital communications against the emerging threat posed by quantum computers, which can potentially break traditional cryptographic algorithms. This paper explores the vulnerabilities of current cryptographic systems to quantum attacks and examines the development of post-quantum algorithms designed to resist such threats. We analyze various candidate cryptographic schemes, including lattice-based, code-based, and multivariate polynomial cryptography, highlighting their theoretical foundations and practical implementations. Additionally, the paper discusses the challenges of transitioning to post-quantum standards, including key management and integration with existing systems.