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

Communications on Applied Nonlinear Analysis

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

Pallavi Niraj Vithalkar

Published Jun 23, 2024• 6 citations
Publisher

Abstract

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.

DOI
10.52783/cana.v31.805

Related papers

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: Securing Digital Communication in the Quantum Era

Mamatha, G S, Namya Dimri, Rasha Sinha

The advent of quantum computing poses a profound threat to traditional cryptographic systems, exposing vulnerabilities that compromise the security of digital communication channels reliant on RSA, ECC, and similar classical encryption methods. Quantum algorithms, notably Shor's algorithm, exploit the inherent computational power of quantum computers to efficiently solve mathematical problems underlying these cryptographic schemes. In response, post-quantum cryptography (PQC) emerged as a critical field aimed at developing resilient cryptographic algorithms impervious to quantum attacks. This paper delineates the vulnerabilities of classical cryptographic systems to quantum attacks, elucidates the principles of quantum computing, and introduces various PQC algorithms such as lattice-based cryptography, code-based cryptography, hash-based cryptography, and multivariate polynomial cryptography. Highlighting the importance of PQC in securing digital communication amidst quantum computing advancements, this research underscores its pivotal role in safeguarding data integrity, confidentiality, and authenticity in the face of emerging quantum threats.

arXiv:2403.11741•Mar 18, 2024•43 citations

A Survey of Cryptographic Algorithms in Cybersecurity: From Classical Methods to Quantum-Resistant Solutions

Swapnali N Tambe-Jagtap

As quantum computing technology evolves, it poses greater risks to current cryptography schemes such as RSA and Elliptic Curve Cryptography (ECC), widely used to secure digital communications These classical algorithms are based on mathematical problems that quantum algorithms such as Shore-Grover deal with. Both, can resolve much faster, making them vulnerable to quantum attack This has given rise to post-quantum cryptography (PQC), which focuses on developing quantum-resistant algorithms to protect data in the future of quantum computers classical cryptography Can Break This paper aims to provide a comprehensive insight into quantum-resistant cryptographic algorithms, including lattice-based, hash-based, code-based, and multivariable polynomial methods. It examines the efficiency, benefits, and challenges associated with implementing these algorithms in real-world applications. By comparing key parameters such as key size, encryption/decryption speed, and signature size, this study examines the relative strengths and limitations of post-quantum algorithms to their classical counterparts The results show that lattice-based algorithms , such as NTRU and Kyber, offer promising solutions with relative efficiency and manageable key sizes, making them potential candidates for quantum-resistant cryptography but other approaches , such as SPHINCS+ (hash-based) and McEliece (code-based), large -Face challenges of key size and slow encryption speed, which may limit their usefulness in some applications Despite these challenges, quantum post-cryptography is necessary to secure the future of digital communications.

Shifra.•Jun 1, 2023•29 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

Exploring Post-Quantum Cryptographic Algorithms for Secure Data Transmission

Sherzod Gulomov, Худайберганов Темур Рустамович, Maftuna X. Ravshanova +2 more

The rapid advancement of quantum computing introduces a critical threat to established cryptographic systems, such as RSA and ECC, by enabling quantum attacks those classical systems cannot withstand. This evolving threat creates a necessity for post-quantum cryptographic (PQC) algorithms to ensure secure data transmission in the quantum era. PQC encompasses diverse approaches, including lattice-based, hash-based, code-based, and multivariate polynomial cryptography. Each category offers distinct advantages and challenges: lattice-based algorithms provide robust security but may require substantial computational resources, while hash-based approaches are easier to implement but limited in flexibility. Code-based algorithms deliver strong security with significant computational demand, and multivariate polynomial approaches boast efficiency, though they face scrutiny over quantum resilience. This paper evaluates these PQC algorithms in terms of their security, performance, and feasibility, identifying optimal methods to secure data transmission in a future where quantum threats are prevalent.

IEEE International Conference on Problems of Informatics, Electronics and Radio Engineering (PIERE)•Nov 15, 2024•13 citations

Quantum‐Safe Cryptography and Future‐Proofing Security

Hewa Majeed Zangana

As quantum computing develops, great revolutionary opportunities and tremendous existential threats urge the need for a change. Traditional encryption algorithms—namely, Rivest–Shamir–Adleman (RSA), Elliptic Curve Cryptography, Diffie–Hellman key exchange—are prone to quantum attacks. Therefore, building quantum-safe cryptography has become the foremost global security challenge. This chapter analyzes the development of quantum-safe cryptography based on post-quantum algorithms such as lattice systems, multivariate polynomial cryptography, hash-based signatures, and code-based encryption. It examines how these cryptographic notions are intended to offer data security in the classical and quantum realms while being able to operate efficiently and interoperate with current digital systems. Possible strategies toward quantum-safe systems are outlined concerning hybrid models for cryptographic implementations, National Institute of Standards and Technology (NIST's) standardization efforts, and real-time integration of artificial intelligence methods for dynamically adjusting the security frameworks in view of adversarial quantum situations. A comprehensive and definitive study of the current advancements, difficulties, and pathways for implementation underlines how organizations can prepare for lasting resilience in the quantum era in security architectures that are scalable and adaptive.

Wiley eBooks•Jul 3, 2026•0 citations
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.
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.
The advent of quantum computing poses a profound threat to traditional cryptographic systems, exposing vulnerabilities that compromise the security of digital communication channels reliant on RSA, ECC, and similar classical encryption methods. Quantum algorithms, notably Shor's algorithm, exploit the inherent computational power of quantum computers to efficiently solve mathematical problems underlying these cryptographic schemes. In response, post-quantum cryptography (PQC) emerged as a critical field aimed at developing resilient cryptographic algorithms impervious to quantum attacks. This paper delineates the vulnerabilities of classical cryptographic systems to quantum attacks, elucidates the principles of quantum computing, and introduces various PQC algorithms such as lattice-based cryptography, code-based cryptography, hash-based cryptography, and multivariate polynomial cryptography. Highlighting the importance of PQC in securing digital communication amidst quantum computing advancements, this research underscores its pivotal role in safeguarding data integrity, confidentiality, and authenticity in the face of emerging quantum threats.
As quantum computing technology evolves, it poses greater risks to current cryptography schemes such as RSA and Elliptic Curve Cryptography (ECC), widely used to secure digital communications These classical algorithms are based on mathematical problems that quantum algorithms such as Shore-Grover deal with. Both, can resolve much faster, making them vulnerable to quantum attack This has given rise to post-quantum cryptography (PQC), which focuses on developing quantum-resistant algorithms to protect data in the future of quantum computers classical cryptography Can Break This paper aims to provide a comprehensive insight into quantum-resistant cryptographic algorithms, including lattice-based, hash-based, code-based, and multivariable polynomial methods. It examines the efficiency, benefits, and challenges associated with implementing these algorithms in real-world applications. By comparing key parameters such as key size, encryption/decryption speed, and signature size, this study examines the relative strengths and limitations of post-quantum algorithms to their classical counterparts The results show that lattice-based algorithms , such as NTRU and Kyber, offer promising solutions with relative efficiency and manageable key sizes, making them potential candidates for quantum-resistant cryptography but other approaches , such as SPHINCS+ (hash-based) and McEliece (code-based), large -Face challenges of key size and slow encryption speed, which may limit their usefulness in some applications Despite these challenges, quantum post-cryptography is necessary to secure the future of digital communications.
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.
The rapid advancement of quantum computing introduces a critical threat to established cryptographic systems, such as RSA and ECC, by enabling quantum attacks those classical systems cannot withstand. This evolving threat creates a necessity for post-quantum cryptographic (PQC) algorithms to ensure secure data transmission in the quantum era. PQC encompasses diverse approaches, including lattice-based, hash-based, code-based, and multivariate polynomial cryptography. Each category offers distinct advantages and challenges: lattice-based algorithms provide robust security but may require substantial computational resources, while hash-based approaches are easier to implement but limited in flexibility. Code-based algorithms deliver strong security with significant computational demand, and multivariate polynomial approaches boast efficiency, though they face scrutiny over quantum resilience. This paper evaluates these PQC algorithms in terms of their security, performance, and feasibility, identifying optimal methods to secure data transmission in a future where quantum threats are prevalent.
As quantum computing develops, great revolutionary opportunities and tremendous existential threats urge the need for a change. Traditional encryption algorithms—namely, Rivest–Shamir–Adleman (RSA), Elliptic Curve Cryptography, Diffie–Hellman key exchange—are prone to quantum attacks. Therefore, building quantum-safe cryptography has become the foremost global security challenge. This chapter analyzes the development of quantum-safe cryptography based on post-quantum algorithms such as lattice systems, multivariate polynomial cryptography, hash-based signatures, and code-based encryption. It examines how these cryptographic notions are intended to offer data security in the classical and quantum realms while being able to operate efficiently and interoperate with current digital systems. Possible strategies toward quantum-safe systems are outlined concerning hybrid models for cryptographic implementations, National Institute of Standards and Technology (NIST's) standardization efforts, and real-time integration of artificial intelligence methods for dynamically adjusting the security frameworks in view of adversarial quantum situations. A comprehensive and definitive study of the current advancements, difficulties, and pathways for implementation underlines how organizations can prepare for lasting resilience in the quantum era in security architectures that are scalable and adaptive.