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

IEEE Access

A Systematic Literature Review of Lattice-Based Key Encapsulation Mechanisms and Digital Signatures: Current Status, Research Gaps, and Future Directions

Dereje Wasihun Mellese, Zebene Girma Tefera, Melaku Berhe Belay, Gizachew Haile Seffa, Adem Guluma Negewo, Zelalem Gizachew, Mekonnen Andualem Atinaf, Daniel Merkebu Adamu

Published Jan 1, 2026• 4 citations
Publisher

Abstract

The progress made in the field of quantum computing has drawn the attention of the cryptographic community to the existing systems’ security. Thus, researchers are looking for post-quantum cryptographic solutions that would be able to defend against the upcoming quantum attacks. To this end, different cryptographic approaches have been proposed. Among these approaches, lattice-based cryptography stands out as a promising candidate because of it’s efficient parameters and performance characteristics. The robustness of these post-quantum methods has been tested against the NIST criteria so that the security they offer can be trusted. In this work, we conducted a systematic literature review on lattice-based KEM and signature schemes. We have analyzed 41 papers taken from five major databases and addressed four research questions that include the current landscape of lattice-based post-quantum cryptography, the gaps in the existing literature on lattice-based post-quantum cryptography, identifying mathematical hard problems used in the papers, and future research directions. The reviewed papers primarily focus on key encapsulation mechanisms (KEM) and signature schemes. One of the key findings of this study is the identification of promising lattice-based cryptographic schemes beyond the NIST finalists, such as Qu-Octonion NTRU, Tyber, and HAETAE etc., which clearly shows there is notable progress in lattice-based post-quantum systems. In addition, this review identifies key gaps in current research, including a lack of emphasis on the tradeoffs between security and efficiency, and an insufficient design of hybrid cryptosystems. Finally, the strengths and limitations of the current lattice-based Cryptosystems and future research directions are presented.

DOI
10.1109/access.2026.3655100

Related papers

Research on Lattice-Based Cryptographic Algorithms

WU Kun, TANG Jinyi, LI Peiqi, WANG Xiaorui, WANG Xiaoyu

The security of classical public-key cryptosystems, which operate based on the computational intractability of integer factorization and discrete logarithm problems, is profoundly threatened by the rapid development of quantum computing. Post-Quantum Cryptography (PQC) has been proposed to improve security against quantum attacks. Lattice-based cryptography is widely regarded as one of the most promising PQC method because of its proven security, efficient implementation, and functional versatility, and it has achieved significant progress in both algorithmic design and engineering implementation in recent years. This paper presents a systematic survey of the status of research on lattice-based cryptographic algorithms. First, the fundamental theory of lattices and their core hard problems are discussed. Next, the technical characteristics and performance of encryption and key encapsulation mechanisms, digital signature schemes, and key exchange protocols constructed based on lattice hard problems are reviewed and compared. Subsequently, the principles and optimization paths of two key technologies for lattice cryptography implementation, namely polynomial multiplication using the fast Number Theoretic Transform (NTT) and pre-image sampling algorithms, are discussed. Finally, considering the PQC standardization process of the National Institute of Standards and Technology (NIST), an outlook on future research directions for lattice-based cryptography is presented. The research directions include the development of more "succinct" fundamental hard problems, strengthening security proofs, improving algorithm efficiency, and countering novel attacks. This review serves as a reference for promoting the practical deployment and further research of lattice-based cryptography.

•Sep 1, 2026•0 citations

A Survey on Digital Signature Schemes in Lattice Based Cryptography

Chetan Joshi, Nirdesh Pal

Quantum computers are moving closer to reality, and with that comes a serious concern for today’s public-key cryptography. Many of the encryption and digital signature systems we rely on now, such as RSA and ECC, may no longer be secure in the future. Because of this, researchers are actively looking for new methods that can protect digital communication in the post-quantum era. One of the most promising directions is lattice-based cryptography. This paper gives a simple and focused review of lattice-based signature schemes. It brings together the main ideas from the existing literature and explains how these schemes are built, why they are considered secure, and what makes them practical. The review mainly discusses schemes based on hard lattice problems such as SIS and LWE. To make the comparison clearer, a table is also included that compares different signature schemes in terms of key size, signature size, security level, and computational efficiency. Overall, this study shows why lattice-based signature schemes are becoming an important part of modern cryptographic research and why they may play a major role in securing digital systems against future quantum threats.

International Journal of Scientific Research in Science Engineering and Technology•May 18, 2026•0 citations

A Survey on Digital Signature Schemes in Lattice Based Cryptography

Chetan Joshi, Nirdesh Pal

Quantum computers are moving closer to reality, and with that comes a serious concern for today's public-key cryptography. Many of the encryption and digital signature systems we rely on now, such as RSA and ECC, may no longer be secure in the future. Because of this, researchers are actively looking for new methods that can protect digital communication in the post-quantum era. One of the most promising directions is lattice-based cryptography. This paper gives a simple and focused review of lattice-based signature schemes. It brings together the main ideas from the existing literature and explains how these schemes are built, why they are considered secure, and what makes them practical. The review mainly discusses schemes based on hard lattice problems such as SIS and LWE. To make the comparison clearer, a table is also included that compares different signature schemes in terms of key size, signature size, security level, and computational efficiency. Overall, this study shows why lattice-based signature schemes are becoming an important part of modern cryptographic research and why they may play a major role in securing digital systems against future quantum threats.

•May 21, 2026•0 citations

Quantum Resilience: Lattice-Based Cryptography for the Post-RSA Era

Revista, Zen, MATH, 10

The advent of quantum computing poses a significant existential threat to current public-key cryptographic standards, particularly RSA and Elliptic Curve Cryptography (ECC), which underpin global digital security. Shor's algorithm, if implemented on a sufficiently powerful quantum computer, can efficiently break these foundational schemes, rendering vast amounts of encrypted data vulnerable. This paper investigates lattice-based cryptography as a robust and promising candidate for post-quantum security. We provide a comprehensive analysis of its theoretical underpinnings, focusing on hard problems like the Shortest Vector Problem (SVP) and Learning With Errors (LWE), which are believed to be intractable even for quantum adversaries. Through a detailed literature review and methodological exposition, we examine the construction principles of prominent lattice-based Key Encapsulation Mechanisms (KEMs) and digital signature schemes, such as Kyber and Dilithium, highlighting their inherent security properties and performance characteristics. Our results demonstrate that lattice-based schemes offer competitive efficiency, compact key sizes, and strong security guarantees against both classical and quantum attacks, positioning them as essential building blocks for the post-RSA cryptographic landscape. The discussion elaborates on the practical implications, standardization efforts by NIST, and the challenges associated with the transition to quantum-resilient cryptographic infrastructure. We conclude that lattice-based cryptography is a cornerstone of quantum resilience, critical for securing future digital communications and data integrity.

•Dec 6, 2025•0 citations

Reconstructing Public-Key Cryptography: Lattice Foundations for a Post-Quantum Future Beyond RSA

Revista, Zen, MATH, 10

The imminent threat posed by the advent of quantum computers to contemporary public-key cryptographic schemes, such as RSA and Elliptic Curve Cryptography (ECC), necessitates a fundamental shift in cryptographic paradigms. Shor's algorithm, specifically, presents a catastrophic vulnerability to these foundational security protocols, underpinning global digital communication and commerce. This paper provides a comprehensive exploration into lattice-based cryptography as a robust and promising candidate for a post-quantum cryptographic future. We delve into the mathematical underpinnings of lattices, elucidating the computational hardness of problems like the Shortest Vector Problem (SVP) and the Learning With Errors (LWE) problem, which form the bedrock of their security. The paper reviews the historical development of lattice-based schemes, their theoretical advantages, and their practical implications, particularly in the context of the ongoing NIST Post-Quantum Cryptography standardization process. We analyze the construction of key encapsulation mechanisms (KEMs) and digital signature schemes from lattice problems, comparing their performance characteristics and security guarantees against classical methods. The work argues that lattice-based cryptography offers a compelling alternative to RSA, providing not only quantum resistance but also presenting attractive features in terms of efficiency, design simplicity, and versatility for various cryptographic primitives. The discussion extends to implementation challenges, security analysis, and the broader implications for the global migration towards a quantum-secure cryptographic infrastructure.

•Dec 5, 2025•0 citations

Lattice Ascendancy: Quantum-Resistant Foundations for Post-RSA Cryptography

Revista, Zen, MATH, 10

The advent of large-scale quantum computers poses a profound and imminent threat to the security foundations of modern cryptography. Widely deployed public-key cryptosystems, such as RSA and Elliptic Curve Cryptography (ECC), rely on problems like integer factorization and discrete logarithms, which Shor's algorithm can efficiently solve. This necessitates a proactive transition to post-quantum cryptography (PQC). Among leading candidates, lattice-based cryptography stands out due to its robust security guarantees, based on hard problems lacking known efficient quantum solutions, and structural properties facilitating efficient implementation. This paper explores the fundamental principles of lattice-based cryptography, detailing underlying mathematical hard problems such as the Shortest Vector Problem ($SVP$) and Learning With Errors ($LWE$). We review the evolution of lattice-based schemes, from early constructions to contemporary candidates like Kyber and Dilithium, emphasizing their suitability for Key Encapsulation Mechanisms (KEMs) and Digital Signature Schemes (DSS). Furthermore, we analyze their performance characteristics, security assumptions, and resilience against classical and quantum attacks, providing a critical comparison with other PQC families. This comprehensive overview, structured through a systematic critical analysis framework, highlights the ascendancy of lattice-based cryptography as a cornerstone for future quantum-resistant security infrastructure, offering theoretical underpinnings, practical implications, and actionable future research directions for a post-quantum world.

•Dec 4, 2025•0 citations
The progress made in the field of quantum computing has drawn the attention of the cryptographic community to the existing systems’ security. Thus, researchers are looking for post-quantum cryptographic solutions that would be able to defend against the upcoming quantum attacks. To this end, different cryptographic approaches have been proposed. Among these approaches, lattice-based cryptography stands out as a promising candidate because of it’s efficient parameters and performance characteristics. The robustness of these post-quantum methods has been tested against the NIST criteria so that the security they offer can be trusted. In this work, we conducted a systematic literature review on lattice-based KEM and signature schemes. We have analyzed 41 papers taken from five major databases and addressed four research questions that include the current landscape of lattice-based post-quantum cryptography, the gaps in the existing literature on lattice-based post-quantum cryptography, identifying mathematical hard problems used in the papers, and future research directions. The reviewed papers primarily focus on key encapsulation mechanisms (KEM) and signature schemes. One of the key findings of this study is the identification of promising lattice-based cryptographic schemes beyond the NIST finalists, such as Qu-Octonion NTRU, Tyber, and HAETAE etc., which clearly shows there is notable progress in lattice-based post-quantum systems. In addition, this review identifies key gaps in current research, including a lack of emphasis on the tradeoffs between security and efficiency, and an insufficient design of hybrid cryptosystems. Finally, the strengths and limitations of the current lattice-based Cryptosystems and future research directions are presented.
The security of classical public-key cryptosystems, which operate based on the computational intractability of integer factorization and discrete logarithm problems, is profoundly threatened by the rapid development of quantum computing. Post-Quantum Cryptography (PQC) has been proposed to improve security against quantum attacks. Lattice-based cryptography is widely regarded as one of the most promising PQC method because of its proven security, efficient implementation, and functional versatility, and it has achieved significant progress in both algorithmic design and engineering implementation in recent years. This paper presents a systematic survey of the status of research on lattice-based cryptographic algorithms. First, the fundamental theory of lattices and their core hard problems are discussed. Next, the technical characteristics and performance of encryption and key encapsulation mechanisms, digital signature schemes, and key exchange protocols constructed based on lattice hard problems are reviewed and compared. Subsequently, the principles and optimization paths of two key technologies for lattice cryptography implementation, namely polynomial multiplication using the fast Number Theoretic Transform (NTT) and pre-image sampling algorithms, are discussed. Finally, considering the PQC standardization process of the National Institute of Standards and Technology (NIST), an outlook on future research directions for lattice-based cryptography is presented. The research directions include the development of more "succinct" fundamental hard problems, strengthening security proofs, improving algorithm efficiency, and countering novel attacks. This review serves as a reference for promoting the practical deployment and further research of lattice-based cryptography.
Quantum computers are moving closer to reality, and with that comes a serious concern for today’s public-key cryptography. Many of the encryption and digital signature systems we rely on now, such as RSA and ECC, may no longer be secure in the future. Because of this, researchers are actively looking for new methods that can protect digital communication in the post-quantum era. One of the most promising directions is lattice-based cryptography. This paper gives a simple and focused review of lattice-based signature schemes. It brings together the main ideas from the existing literature and explains how these schemes are built, why they are considered secure, and what makes them practical. The review mainly discusses schemes based on hard lattice problems such as SIS and LWE. To make the comparison clearer, a table is also included that compares different signature schemes in terms of key size, signature size, security level, and computational efficiency. Overall, this study shows why lattice-based signature schemes are becoming an important part of modern cryptographic research and why they may play a major role in securing digital systems against future quantum threats.
Quantum computers are moving closer to reality, and with that comes a serious concern for today's public-key cryptography. Many of the encryption and digital signature systems we rely on now, such as RSA and ECC, may no longer be secure in the future. Because of this, researchers are actively looking for new methods that can protect digital communication in the post-quantum era. One of the most promising directions is lattice-based cryptography. This paper gives a simple and focused review of lattice-based signature schemes. It brings together the main ideas from the existing literature and explains how these schemes are built, why they are considered secure, and what makes them practical. The review mainly discusses schemes based on hard lattice problems such as SIS and LWE. To make the comparison clearer, a table is also included that compares different signature schemes in terms of key size, signature size, security level, and computational efficiency. Overall, this study shows why lattice-based signature schemes are becoming an important part of modern cryptographic research and why they may play a major role in securing digital systems against future quantum threats.
The advent of quantum computing poses a significant existential threat to current public-key cryptographic standards, particularly RSA and Elliptic Curve Cryptography (ECC), which underpin global digital security. Shor's algorithm, if implemented on a sufficiently powerful quantum computer, can efficiently break these foundational schemes, rendering vast amounts of encrypted data vulnerable. This paper investigates lattice-based cryptography as a robust and promising candidate for post-quantum security. We provide a comprehensive analysis of its theoretical underpinnings, focusing on hard problems like the Shortest Vector Problem (SVP) and Learning With Errors (LWE), which are believed to be intractable even for quantum adversaries. Through a detailed literature review and methodological exposition, we examine the construction principles of prominent lattice-based Key Encapsulation Mechanisms (KEMs) and digital signature schemes, such as Kyber and Dilithium, highlighting their inherent security properties and performance characteristics. Our results demonstrate that lattice-based schemes offer competitive efficiency, compact key sizes, and strong security guarantees against both classical and quantum attacks, positioning them as essential building blocks for the post-RSA cryptographic landscape. The discussion elaborates on the practical implications, standardization efforts by NIST, and the challenges associated with the transition to quantum-resilient cryptographic infrastructure. We conclude that lattice-based cryptography is a cornerstone of quantum resilience, critical for securing future digital communications and data integrity.
The imminent threat posed by the advent of quantum computers to contemporary public-key cryptographic schemes, such as RSA and Elliptic Curve Cryptography (ECC), necessitates a fundamental shift in cryptographic paradigms. Shor's algorithm, specifically, presents a catastrophic vulnerability to these foundational security protocols, underpinning global digital communication and commerce. This paper provides a comprehensive exploration into lattice-based cryptography as a robust and promising candidate for a post-quantum cryptographic future. We delve into the mathematical underpinnings of lattices, elucidating the computational hardness of problems like the Shortest Vector Problem (SVP) and the Learning With Errors (LWE) problem, which form the bedrock of their security. The paper reviews the historical development of lattice-based schemes, their theoretical advantages, and their practical implications, particularly in the context of the ongoing NIST Post-Quantum Cryptography standardization process. We analyze the construction of key encapsulation mechanisms (KEMs) and digital signature schemes from lattice problems, comparing their performance characteristics and security guarantees against classical methods. The work argues that lattice-based cryptography offers a compelling alternative to RSA, providing not only quantum resistance but also presenting attractive features in terms of efficiency, design simplicity, and versatility for various cryptographic primitives. The discussion extends to implementation challenges, security analysis, and the broader implications for the global migration towards a quantum-secure cryptographic infrastructure.
The advent of large-scale quantum computers poses a profound and imminent threat to the security foundations of modern cryptography. Widely deployed public-key cryptosystems, such as RSA and Elliptic Curve Cryptography (ECC), rely on problems like integer factorization and discrete logarithms, which Shor's algorithm can efficiently solve. This necessitates a proactive transition to post-quantum cryptography (PQC). Among leading candidates, lattice-based cryptography stands out due to its robust security guarantees, based on hard problems lacking known efficient quantum solutions, and structural properties facilitating efficient implementation. This paper explores the fundamental principles of lattice-based cryptography, detailing underlying mathematical hard problems such as the Shortest Vector Problem (SVPSVPSVP) and Learning With Errors (LWELWELWE). We review the evolution of lattice-based schemes, from early constructions to contemporary candidates like Kyber and Dilithium, emphasizing their suitability for Key Encapsulation Mechanisms (KEMs) and Digital Signature Schemes (DSS). Furthermore, we analyze their performance characteristics, security assumptions, and resilience against classical and quantum attacks, providing a critical comparison with other PQC families. This comprehensive overview, structured through a systematic critical analysis framework, highlights the ascendancy of lattice-based cryptography as a cornerstone for future quantum-resistant security infrastructure, offering theoretical underpinnings, practical implications, and actionable future research directions for a post-quantum world.