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

Post-quantum Lattice-based Cryptography

Rebecca Staffas

Published Jan 1, 2016• 4 citations
OpenAlex

Abstract

In a future full of quantum computers, new foundations for asymmetric cryptography are needed. We study the theoretical foundations for lattice-based cryptography as well as the current state on cryptographic attacks against them. We then turn our attention to signature systems and especially the system BLISS from 2013. We give an overview of the BLISS protocol and its security, and analyse its object sizes and resistance to attacks. We find that BLISS does not provide as high security as initially claimed. We then propose modifications to BLISS in order to allow for freer choices of dimension and modulus. We also propose novel implementation tricks and accommodate for these in the protocol. We call our modified system REBLISS and propose parameter sets. Our performance measurements suggest that this is a good alternative to BLISS.

Related papers

Post-Quantum Cryptography Using Lattices

Patchigulla Pooja, Jakka Ramya, Paras Nath Singh +4 more

The need and emergence of quantum computing under National Quantum Mission threatens the cyber-security of existing cryptographic protocols, especially public-key schemes built on integer factorization and discrete logarithms. Lattice-based cryptography has gained prominence as a robust candidate for post-quantum cryptography—offering security against quantum attacks while enabling efficient operations, parallelization, and novel functionalities. This paper analyzes the mathematical foundations of lattices, explores hardness assumptions underlying widely studied lattice problems, highlights prominent cryptographic constructions, analyzes performance trade-offs, and reviews standardization efforts. This paper concludes by identifying ongoing issues and future directions for lattice-based cryptographic systems in a quantum-secure digital world. The algorithm has been implemented in Python.

IEEE Global Conference for Advancement in Technology (GCAT)•Oct 24, 2025•0 citations

Progress in Lattice-Based Digital Signature

Pooja Bhatt, Rachna Navalakhe

Mostly, existing public-key cryptosystems are constructed on the mathematical complexity of large integer factorization and solving discrete logarithms, which will be irresistible to attacks of future quantum computers. Due to the rapidly growing vulnerabilities in cryptographic systems recently, post-quantum cryptography (PQC) has turned out to be a need for the crypto community and has become a necessary research domain for the welfare of society. Lattice-based cryptography is measured as the most capable PQC because of its intense security proofs based on worst-case hardness, balanced performance in security, and efficient computation. This chapter provides a mathematical foundation of lattice-based cryptography, existing digital signatures, different attacks on lattice-based signatures with toy examples, challenges in lattice-based digital signatures, and future research directions. For scholars and academicians functioning in this emerging field of post PQC, the main unresolved issues evaluated in this study will provide an easily navigable reference and a unified, comprehensive source of data on lattice-based cryptography.

CRC Press eBooks•Jun 2, 2026•0 citations

Post-Quantum Lattice-Based Cryptography: A Quantum-Resistant Cryptosystem

Aarti Dadheech

Quantum cryptography is a branch of cryptography that is a mixture of quantum mechanics and classical cryptography. The study of quantum cryptography is to design cryptographic algorithms and protocols that are against quantum computing attacks. In this chapter, the authors focus on analyzing characteristics of the quantum-proof cryptosystem and its applications in the future internet. Lattice-based cryptography provides a much stronger belief of security, in that the average-case of certain problems is equivalent to the worst-case of those problems. With the increase in cryptanalytic attacks conventional cryptographic schemes will soon become obsolete. As the reality of quantum computing approaches, these cryptosystems will need to be replaced with efficient quantum-resistant cryptosystems. We need an alternate security mechanism which is as hard as the existing number theoretic approaches. In this chapter, the authors discuss the security dimension of lattice-based cryptography whose strength lies in the hardness of lattice problems and also study its application areas.

Advances in information security, privacy, and ethics book series•Jan 1, 2021•4 citations

Post-Quantum Cryptography: can Classical Algorithms Resist Quantum Attacks

Dinh Doan Xuan Phuong, Pham Truong Son

Quantum computing threatens current public-key cryptographic systems, necessitating a transition to quantum-resistant alternatives. This paper analyzes how Shor's algorithm enables quantum computers to efficiently break RSA and Elliptic Curve Cryptography by solving their underlying mathematical problems, demonstrating these systems cannot be salvaged through parameter increases. We evaluate lattice-based cryptography as a post-quantum solution, examining its foundation on high-dimensional lattice problems such as the Shortest Vector Problem and Learning With Errors. Through analysis of NIST-standardized algorithms CRYSTALS-Kyber and CRYSTALS-Dilithium, we assess the security assumptions, computational efficiency, and implementation considerations of lattice-based schemes. Our findings reveal that while quantum computing poses an existential threat to current cryptographic infrastructure, lattice-based cryptography provides a viable quantum-resistant alternative with strong security guarantees and practical performance characteristics.

RIVF International Conference on Computing and Communication Technologies (RIVF)•Dec 18, 2025•0 citations

From Integer Factorization to Lattices: A Post-Quantum Paradigm for Asymmetric Cryptography

Revista, Zen, MATH, 10

The advent of quantum computing poses a significant threat to the security of current asymmetric cryptographic systems, which underpin much of modern digital communication and security. These systems, predominantly RSA and Elliptic Curve Cryptography (ECC), rely on the computational hardness of mathematical problems such as integer factorization and the discrete logarithm problem. Shor's algorithm, a quantum algorithm, demonstrates the ability to efficiently solve these problems, rendering classical public-key cryptography vulnerable to attacks by sufficiently powerful quantum computers. This paper argues for and thoroughly examines the strategic imperative of transitioning from these classical cryptographic foundations to a new paradigm based on lattices, which are believed to be resistant to quantum attacks. We delve into the fundamental mathematical problems underlying lattice-based cryptography, such as the Shortest Vector Problem (SVP) and the Learning With Errors (LWE) problem, whose worst-case hardness is leveraged to achieve cryptographic security. A comprehensive literature review is provided, tracing the evolution of quantum threats and the emergence of lattice-based schemes. The methodology details the construction principles of prominent lattice-based cryptosystems. Results demonstrate their theoretical security against quantum adversaries and highlight their practical attributes, including compact key sizes and competitive performance. The discussion section contextualizes lattice-based cryptography within the broader landscape of post-quantum candidates, examining their strengths, weaknesses, and the ongoing standardization efforts by organizations like NIST. We conclude that lattice-based cryptography offers a robust and promising foundation for building resilient asymmetric cryptographic systems in the post-quantum era, ensuring the long-term security of digital information through a necessary re-architecture of cryptographic primitives.

•Nov 25, 2025•0 citations

Quantum-Resistant Cryptographic Protocols for Post-Quantum Secure Communications

Padma Guntupalli, M. Chandana, M. Rashi +3 more

The development of quantum computing poses a very real threat to traditional cryptography, especially these, which are number-theoretic like RSA and ECC. With the more and more development of quantum algorithms such as Shor and Grover, there is an immediate necessity to come up with cryptographic protocols that are resistant to quantum attacks. This paper reviews and discusses different quantum-resistant (post-quantum) cryptographic schemes, such as lattice-based, code-based, multivariate, hash-based, and isogeny-based cryptography. It compares these protocols on the assumptions of their security and their efficiency in their computation and the size of their keys as well as their possible integrations into the existing communication infrastructure. Moreover, we also evaluate the standardization process by NIST and the difficulties of moving towards post-quantum security in practical use. This paper proposes a scalable comparison system, which correlates the hypothetical security basis of postquantum cryptography with the ability to effectively operate in the real world. It has emphasized protocol interoperability, migration compatibility and trade-offs in performance that gives a viable roadmap towards quantum-resistant cryptographic protocols implementation into current communication infrastructures whilst also providing scalable and future secure communication systems. This study, by emphasizing the potential and the drawbacks of the existing post-quantum cryptography schemes, helps in a more precise idea of the directions to follow on the way to a secure, future-proof communications scheme.

International Conference on Computing for Sustainable Global Development•Apr 8, 2026•0 citations
In a future full of quantum computers, new foundations for asymmetric cryptography are needed. We study the theoretical foundations for lattice-based cryptography as well as the current state on cryptographic attacks against them. We then turn our attention to signature systems and especially the system BLISS from 2013. We give an overview of the BLISS protocol and its security, and analyse its object sizes and resistance to attacks. We find that BLISS does not provide as high security as initially claimed. We then propose modifications to BLISS in order to allow for freer choices of dimension and modulus. We also propose novel implementation tricks and accommodate for these in the protocol. We call our modified system REBLISS and propose parameter sets. Our performance measurements suggest that this is a good alternative to BLISS.
The need and emergence of quantum computing under National Quantum Mission threatens the cyber-security of existing cryptographic protocols, especially public-key schemes built on integer factorization and discrete logarithms. Lattice-based cryptography has gained prominence as a robust candidate for post-quantum cryptography—offering security against quantum attacks while enabling efficient operations, parallelization, and novel functionalities. This paper analyzes the mathematical foundations of lattices, explores hardness assumptions underlying widely studied lattice problems, highlights prominent cryptographic constructions, analyzes performance trade-offs, and reviews standardization efforts. This paper concludes by identifying ongoing issues and future directions for lattice-based cryptographic systems in a quantum-secure digital world. The algorithm has been implemented in Python.
Mostly, existing public-key cryptosystems are constructed on the mathematical complexity of large integer factorization and solving discrete logarithms, which will be irresistible to attacks of future quantum computers. Due to the rapidly growing vulnerabilities in cryptographic systems recently, post-quantum cryptography (PQC) has turned out to be a need for the crypto community and has become a necessary research domain for the welfare of society. Lattice-based cryptography is measured as the most capable PQC because of its intense security proofs based on worst-case hardness, balanced performance in security, and efficient computation. This chapter provides a mathematical foundation of lattice-based cryptography, existing digital signatures, different attacks on lattice-based signatures with toy examples, challenges in lattice-based digital signatures, and future research directions. For scholars and academicians functioning in this emerging field of post PQC, the main unresolved issues evaluated in this study will provide an easily navigable reference and a unified, comprehensive source of data on lattice-based cryptography.
Quantum cryptography is a branch of cryptography that is a mixture of quantum mechanics and classical cryptography. The study of quantum cryptography is to design cryptographic algorithms and protocols that are against quantum computing attacks. In this chapter, the authors focus on analyzing characteristics of the quantum-proof cryptosystem and its applications in the future internet. Lattice-based cryptography provides a much stronger belief of security, in that the average-case of certain problems is equivalent to the worst-case of those problems. With the increase in cryptanalytic attacks conventional cryptographic schemes will soon become obsolete. As the reality of quantum computing approaches, these cryptosystems will need to be replaced with efficient quantum-resistant cryptosystems. We need an alternate security mechanism which is as hard as the existing number theoretic approaches. In this chapter, the authors discuss the security dimension of lattice-based cryptography whose strength lies in the hardness of lattice problems and also study its application areas.
Quantum computing threatens current public-key cryptographic systems, necessitating a transition to quantum-resistant alternatives. This paper analyzes how Shor's algorithm enables quantum computers to efficiently break RSA and Elliptic Curve Cryptography by solving their underlying mathematical problems, demonstrating these systems cannot be salvaged through parameter increases. We evaluate lattice-based cryptography as a post-quantum solution, examining its foundation on high-dimensional lattice problems such as the Shortest Vector Problem and Learning With Errors. Through analysis of NIST-standardized algorithms CRYSTALS-Kyber and CRYSTALS-Dilithium, we assess the security assumptions, computational efficiency, and implementation considerations of lattice-based schemes. Our findings reveal that while quantum computing poses an existential threat to current cryptographic infrastructure, lattice-based cryptography provides a viable quantum-resistant alternative with strong security guarantees and practical performance characteristics.
The advent of quantum computing poses a significant threat to the security of current asymmetric cryptographic systems, which underpin much of modern digital communication and security. These systems, predominantly RSA and Elliptic Curve Cryptography (ECC), rely on the computational hardness of mathematical problems such as integer factorization and the discrete logarithm problem. Shor's algorithm, a quantum algorithm, demonstrates the ability to efficiently solve these problems, rendering classical public-key cryptography vulnerable to attacks by sufficiently powerful quantum computers. This paper argues for and thoroughly examines the strategic imperative of transitioning from these classical cryptographic foundations to a new paradigm based on lattices, which are believed to be resistant to quantum attacks. We delve into the fundamental mathematical problems underlying lattice-based cryptography, such as the Shortest Vector Problem (SVP) and the Learning With Errors (LWE) problem, whose worst-case hardness is leveraged to achieve cryptographic security. A comprehensive literature review is provided, tracing the evolution of quantum threats and the emergence of lattice-based schemes. The methodology details the construction principles of prominent lattice-based cryptosystems. Results demonstrate their theoretical security against quantum adversaries and highlight their practical attributes, including compact key sizes and competitive performance. The discussion section contextualizes lattice-based cryptography within the broader landscape of post-quantum candidates, examining their strengths, weaknesses, and the ongoing standardization efforts by organizations like NIST. We conclude that lattice-based cryptography offers a robust and promising foundation for building resilient asymmetric cryptographic systems in the post-quantum era, ensuring the long-term security of digital information through a necessary re-architecture of cryptographic primitives.
The development of quantum computing poses a very real threat to traditional cryptography, especially these, which are number-theoretic like RSA and ECC. With the more and more development of quantum algorithms such as Shor and Grover, there is an immediate necessity to come up with cryptographic protocols that are resistant to quantum attacks. This paper reviews and discusses different quantum-resistant (post-quantum) cryptographic schemes, such as lattice-based, code-based, multivariate, hash-based, and isogeny-based cryptography. It compares these protocols on the assumptions of their security and their efficiency in their computation and the size of their keys as well as their possible integrations into the existing communication infrastructure. Moreover, we also evaluate the standardization process by NIST and the difficulties of moving towards post-quantum security in practical use. This paper proposes a scalable comparison system, which correlates the hypothetical security basis of postquantum cryptography with the ability to effectively operate in the real world. It has emphasized protocol interoperability, migration compatibility and trade-offs in performance that gives a viable roadmap towards quantum-resistant cryptographic protocols implementation into current communication infrastructures whilst also providing scalable and future secure communication systems. This study, by emphasizing the potential and the drawbacks of the existing post-quantum cryptography schemes, helps in a more precise idea of the directions to follow on the way to a secure, future-proof communications scheme.