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

IACR Transactions on Cryptographic Hardware and Embedded Systems

Structured Module Lattice-based Cryptography: Fine-Grained Parameter Selection without Compromising Performance

Joppe W. Bos, Joost Renes, Fréderik Vercauteren, Peng Wang

Published Jul 17, 2026• 1 citation
Publisher

Abstract

The ongoing transition to Post-Quantum Cryptography (PQC) has highlighted the need for cryptographic schemes that offer high security, strong performance, and fine-grained parameter selection. In lattice-based cryptography, particularly for the popular module variants of learning with errors (Module-LWE) and learning with rounding (Module-LWR) schemes based on power-of-two cyclotomics, existing constructions often force parameter choices that either overshoot or undershoot desired security levels due to structural constraints. In this work, we introduce a new class of techniques that are the advantages of both worlds: structured Module-LWE (or LWR) embeds more algebraic structure than a module such that it significantly improves performance, yet less structure than a power-of-two cyclotomic ring such that it still enables more flexible and efficient parameter selection. We present two concrete instances: a construction based on a radical extension of a two-power cyclotomic field denoted radical Ring-LWE (RR-LWE) or Ring-LWR (RR-LWR), and a cyclotomic block-ring module lattice approach (BRM-LWE or BRM-LWR). These new structured Module-LWE and LWR reduce the required number of uniformly random bytes in its matrix by a factor up to the module rank and allow efficient NTT implementations while enabling more granular security-performance trade-offs. We analyze the security of these constructions, provide practical parameter sets, and present implementation results demonstrating a performance improvement of up to 37% compared to an optimized implementation of ML-KEM. Our techniques apply to both key encapsulation mechanisms and digital signature schemes, offering a pathway to more adaptable and performant PQC standards.

DOI
10.46586/tches.v2026.i3.1032-1055

Related papers

Improved Ring LWR-Based Key Encapsulation Mechanism Using Cyclotomic Trinomials

So Hyun Park, Suhri Kim, Dong Hoon Lee +1 more

In the field of post-quantum cryptography, lattice-based cryptography has received the most noticeable attention. Most lattice-based cryptographic schemes are constructed based on the polynomial ring Rq= Zq[x]/f (x), using a cyclotomic polynomial f (x). Until now, the most preferred cyclotomic polynomials have been xn+ 1, where n is a power of two, and xn+ · · · + x + 1, where n + 1 is a prime. The former results in the smallest decryption error size, but the choice of degree is limited. On the other hand, the latter gives rise to the largest decryption error size, but the choice of degree is very flexible. In this paper, we use a new polynomial ring Rq = Zq/f (x) with a cyclotomic trinomial f (x) = xn- xn/2+ 1 as an intermediate that combines the advantages of the other rings. Since the degree n is chosen freely as n = 2a3bfor positive integers a and b, the choice of the degree n is moderate. Furthermore, since the error propagation is small in the middle of polynomial multiplication in the new ring, if the middle part is truncated and used, the decryption error size can be reduced. Based on these observations, we propose a new, practical key encapsulation mechanism (KEM) that is constructed over a ring with a cyclotomic trinomial. The security of our KEM is based on the hardness of ring learning-with-rounding (LWR) problems. With appropriate parameterization for the current 128-bit security model, we show that our KEM obtains shorter secret keys and ciphertexts, especially compared to the previous Ring-LWR-based KEM, Round5, with no error correction code. We then implement our KEM and compare its performance with that of several KEMs that were presented in the second round of the NIST PQC conference.

IEEE Access•Jan 1, 2020•6 citations

Module-LWE Cryptosystems: A Post-Quantum RSA Replacement with Tightly Reduced Hardness

Revista, Zen, MATH, 10

The imminent threat posed by cryptographically relevant quantum computers necessitates a paradigm shift in public-key cryptography. Traditional schemes like RSA and Elliptic Curve Cryptography (ECC), the bedrock of modern secure communication, are vulnerable to quantum algorithms such as Shor's. This paper explores Module-LWE (Learning With Errors) cryptosystems as a compelling post-quantum replacement for RSA. We delve into the foundational mathematical properties of Module-LWE, highlighting its security rooted in the presumed intractability of hard lattice problems. A key focus is the concept of "tightly reduced hardness," which signifies that the security of a cryptographic scheme based on Module-LWE can be directly and efficiently linked to the worst-case hardness of an underlying lattice problem. This tight reduction allows for more aggressive parameter choices, leading to improved efficiency, smaller key and ciphertext sizes, and enhanced performance compared to generic LWE or other post-quantum candidates, without compromising security. We analyze the advantages of Module-LWE in terms of provable security, performance characteristics, and its suitability for key encapsulation mechanisms and digital signatures. The discussion encompasses its practical implications, implementation considerations, and its strong position within the NIST Post-Quantum Cryptography standardization effort, ultimately presenting Module-LWE as a robust, efficient, and future-proof alternative to RSA in a post-quantum world.

•Dec 3, 2025•0 citations

Analysis of Ring-LWE and LWR Cryptographic Schemes: Foundations, Implementation, and Performance

Sandip Kanoo

Lattice-based cryptography has emerged as a leading framework for securing communication in the post-quantum era, supported by strong worst-case hardness guarantees.This study focuses on two central constructions, Ring Learning with Errors (Ring-LWE) and Learning with Rounding (LWR), and examines their mathematical foundations, implementation behavior, and performance characteristics.While Ring-LWE benefits from well-established and conservative security reductions, along with broad applicability across cryptographic primitives, its reliance on discrete Gaussian sampling introduces computational overhead and potential side-channel vulnerabilities.In contrast, LWR replaces stochastic noise with deterministic rounding, thereby simplifying implementation and improving efficiency, particularly on resource-constrained platforms, albeit under comparatively newer and less conservative hardness assumptions.Both schemes are implemented and benchmarked across multiple parameter sets, enabling a systematic comparison of key generation, encryption, and decryption costs.The experimental results highlight the complementary strengths of these approaches and suggest that hybrid constructions may effectively combine the strong theoretical guarantees of Ring-LWE with the practical efficiency of LWR.

International Journal of Applied Science and Engineering•Dec 25, 2025•0 citations

A Systematic Review of Lattice-Induced Key Exchange with Optimized Polynomial Sampling: Methods, Architectures, and Future Research Directions

A. G. Lewis, B. Horváth, R. Costa

Lattice-based cryptography has emerged as a leading approach for post-quantum secure communication, particularly in key exchange mechanisms such as Key Encapsulation Mechanisms (KEMs). Prominent schemes based on Learning with Errors (LWE), Ring-LWE, Module-LWE, and NTRU lattices provide strong resistance to quantum attacks while maintaining practical efficiency. A key factor influencing their performance and security is polynomial sampling, which controls noise generation, randomness, and key distribution. This systematic review examines advancements in lattice-based key exchange mechanisms with a focus on optimized polynomial sampling techniques, based on 30 peer-reviewed studies. The approaches are categorized into algorithmic improvements, hardware acceleration, side-channel resistant sampling, and emerging intelligent optimization methods. Efficient polynomial arithmetic, Number Theoretic Transform (NTT)-based multiplication, and structured lattices significantly enhance performance. Optimized sampling techniques reduce computational cost and energy consumption while preserving statistical accuracy. However, polynomial sampling remains vulnerable to side-channel attacks such as timing and power analysis, prompting the use of countermeasures like constant-time and masked sampling. Hardware implementations further improve efficiency, though challenges persist in balancing scalability, security, and performance, highlighting the need for adaptive and robust solutions.

International Journal on Advanced Computer Theory and Engineering•Oct 20, 2025•0 citations

Flexible and Compact MLWE-Based KEM

Wenqi Liang, Zhaoman Liu, Xuyang Zhao +2 more

In order to resist the security risks caused by quantum computing, post-quantum cryptography (PQC) has been a research focus. Constructing a key encapsulation mechanism (KEM) based on lattices is one of the promising PQC routines. The algebraically structured learning with errors (LWE) problem over power-of-two cyclotomics has been one of the most widely used hardness assumptions for lattice-based cryptographic schemes. However, power-of-two cyclotomic rings may be exploited in the inflexibility of selecting parameters. Recently, trinomial cyclotomic rings of the form Zq[x]/(xn−xn/2+1), where n=2k3l, k≥1,l≥0, have received widespread attention due to their flexible parameter selection. In this paper, we propose Tyber, a variant scheme of the NIST-standardized KEM candidate Kyber over trinomial cyclotomic rings. We provide three parameter sets, aiming at the quantum security of 128, 192, and 256 bits (actually achieving 129, 197, and 276 bits) with matching and negligible error probabilities. When compared to Kyber, our Tyber exhibits stronger quantum security, by 22, 31, and 44 bits, than Kyber for three security levels.

Mathematics•Jun 6, 2024•3 citations

A novel framework for post-quantum cryptographic schemes based on lattice-theoretic and discrete optimization techniques

Dr.Gaganjot Kaur, Mandeep Kaur, Darapu Uma +3 more

The fast development of quantum computing is a major threat to the classical cryptographic systems and the emergence of secure and efficient post-quantum cryptographic (PQC) is required.Lattice-based cryptography is one of the potential solutions that have been adopted as one of the promising solutions due to its excellent security grounds and quantum resistant nature.Nevertheless, there are difficulties of large key sizes, high computing power and flexibility to diverse application environments that plague existing lattice-based schemes.This paper introduces a new model which combines lattice-theoretic concepts and discrete optimization methods to improve the performance and scalability of PQC systems.Its methodology includes the use of optimization-based key generation, adaptive parameter choice, and using efficient encryption-decryption mechanisms that are based on the Learning With Errors (LWE) problem.Key metrics, such as key size, computation time and error rate, are used to evaluate the comprehensive performance and compared to the known schemes, such as Kyber, NTRU and Saber.Experimental evidence shows that the given model has the smaller key size of 2.4 KB, shorter calculation time of 13.9 ms and smaller error rate of 0.3 that is superior to existing techniques.The results suggest that the suggested framework offers the best compromise in terms of security, performance, and scalability, thus it is applicable to the next-generation secure communication framework in the post-quantum world.

Journal of Discrete Mathematical Sciences and Cryptography•Oct 31, 2026•0 citations
The ongoing transition to Post-Quantum Cryptography (PQC) has highlighted the need for cryptographic schemes that offer high security, strong performance, and fine-grained parameter selection. In lattice-based cryptography, particularly for the popular module variants of learning with errors (Module-LWE) and learning with rounding (Module-LWR) schemes based on power-of-two cyclotomics, existing constructions often force parameter choices that either overshoot or undershoot desired security levels due to structural constraints. In this work, we introduce a new class of techniques that are the advantages of both worlds: structured Module-LWE (or LWR) embeds more algebraic structure than a module such that it significantly improves performance, yet less structure than a power-of-two cyclotomic ring such that it still enables more flexible and efficient parameter selection. We present two concrete instances: a construction based on a radical extension of a two-power cyclotomic field denoted radical Ring-LWE (RR-LWE) or Ring-LWR (RR-LWR), and a cyclotomic block-ring module lattice approach (BRM-LWE or BRM-LWR). These new structured Module-LWE and LWR reduce the required number of uniformly random bytes in its matrix by a factor up to the module rank and allow efficient NTT implementations while enabling more granular security-performance trade-offs. We analyze the security of these constructions, provide practical parameter sets, and present implementation results demonstrating a performance improvement of up to 37% compared to an optimized implementation of ML-KEM. Our techniques apply to both key encapsulation mechanisms and digital signature schemes, offering a pathway to more adaptable and performant PQC standards.
In the field of post-quantum cryptography, lattice-based cryptography has received the most noticeable attention. Most lattice-based cryptographic schemes are constructed based on the polynomial ring Rq= Zq[x]/f (x), using a cyclotomic polynomial f (x). Until now, the most preferred cyclotomic polynomials have been xn+ 1, where n is a power of two, and xn+ · · · + x + 1, where n + 1 is a prime. The former results in the smallest decryption error size, but the choice of degree is limited. On the other hand, the latter gives rise to the largest decryption error size, but the choice of degree is very flexible. In this paper, we use a new polynomial ring Rq = Zq/f (x) with a cyclotomic trinomial f (x) = xn- xn/2+ 1 as an intermediate that combines the advantages of the other rings. Since the degree n is chosen freely as n = 2a3bfor positive integers a and b, the choice of the degree n is moderate. Furthermore, since the error propagation is small in the middle of polynomial multiplication in the new ring, if the middle part is truncated and used, the decryption error size can be reduced. Based on these observations, we propose a new, practical key encapsulation mechanism (KEM) that is constructed over a ring with a cyclotomic trinomial. The security of our KEM is based on the hardness of ring learning-with-rounding (LWR) problems. With appropriate parameterization for the current 128-bit security model, we show that our KEM obtains shorter secret keys and ciphertexts, especially compared to the previous Ring-LWR-based KEM, Round5, with no error correction code. We then implement our KEM and compare its performance with that of several KEMs that were presented in the second round of the NIST PQC conference.
The imminent threat posed by cryptographically relevant quantum computers necessitates a paradigm shift in public-key cryptography. Traditional schemes like RSA and Elliptic Curve Cryptography (ECC), the bedrock of modern secure communication, are vulnerable to quantum algorithms such as Shor's. This paper explores Module-LWE (Learning With Errors) cryptosystems as a compelling post-quantum replacement for RSA. We delve into the foundational mathematical properties of Module-LWE, highlighting its security rooted in the presumed intractability of hard lattice problems. A key focus is the concept of "tightly reduced hardness," which signifies that the security of a cryptographic scheme based on Module-LWE can be directly and efficiently linked to the worst-case hardness of an underlying lattice problem. This tight reduction allows for more aggressive parameter choices, leading to improved efficiency, smaller key and ciphertext sizes, and enhanced performance compared to generic LWE or other post-quantum candidates, without compromising security. We analyze the advantages of Module-LWE in terms of provable security, performance characteristics, and its suitability for key encapsulation mechanisms and digital signatures. The discussion encompasses its practical implications, implementation considerations, and its strong position within the NIST Post-Quantum Cryptography standardization effort, ultimately presenting Module-LWE as a robust, efficient, and future-proof alternative to RSA in a post-quantum world.
Lattice-based cryptography has emerged as a leading framework for securing communication in the post-quantum era, supported by strong worst-case hardness guarantees.This study focuses on two central constructions, Ring Learning with Errors (Ring-LWE) and Learning with Rounding (LWR), and examines their mathematical foundations, implementation behavior, and performance characteristics.While Ring-LWE benefits from well-established and conservative security reductions, along with broad applicability across cryptographic primitives, its reliance on discrete Gaussian sampling introduces computational overhead and potential side-channel vulnerabilities.In contrast, LWR replaces stochastic noise with deterministic rounding, thereby simplifying implementation and improving efficiency, particularly on resource-constrained platforms, albeit under comparatively newer and less conservative hardness assumptions.Both schemes are implemented and benchmarked across multiple parameter sets, enabling a systematic comparison of key generation, encryption, and decryption costs.The experimental results highlight the complementary strengths of these approaches and suggest that hybrid constructions may effectively combine the strong theoretical guarantees of Ring-LWE with the practical efficiency of LWR.
Lattice-based cryptography has emerged as a leading approach for post-quantum secure communication, particularly in key exchange mechanisms such as Key Encapsulation Mechanisms (KEMs). Prominent schemes based on Learning with Errors (LWE), Ring-LWE, Module-LWE, and NTRU lattices provide strong resistance to quantum attacks while maintaining practical efficiency. A key factor influencing their performance and security is polynomial sampling, which controls noise generation, randomness, and key distribution. This systematic review examines advancements in lattice-based key exchange mechanisms with a focus on optimized polynomial sampling techniques, based on 30 peer-reviewed studies. The approaches are categorized into algorithmic improvements, hardware acceleration, side-channel resistant sampling, and emerging intelligent optimization methods. Efficient polynomial arithmetic, Number Theoretic Transform (NTT)-based multiplication, and structured lattices significantly enhance performance. Optimized sampling techniques reduce computational cost and energy consumption while preserving statistical accuracy. However, polynomial sampling remains vulnerable to side-channel attacks such as timing and power analysis, prompting the use of countermeasures like constant-time and masked sampling. Hardware implementations further improve efficiency, though challenges persist in balancing scalability, security, and performance, highlighting the need for adaptive and robust solutions.
In order to resist the security risks caused by quantum computing, post-quantum cryptography (PQC) has been a research focus. Constructing a key encapsulation mechanism (KEM) based on lattices is one of the promising PQC routines. The algebraically structured learning with errors (LWE) problem over power-of-two cyclotomics has been one of the most widely used hardness assumptions for lattice-based cryptographic schemes. However, power-of-two cyclotomic rings may be exploited in the inflexibility of selecting parameters. Recently, trinomial cyclotomic rings of the form Zq[x]/(xn−xn/2+1), where n=2k3l, k≥1,l≥0, have received widespread attention due to their flexible parameter selection. In this paper, we propose Tyber, a variant scheme of the NIST-standardized KEM candidate Kyber over trinomial cyclotomic rings. We provide three parameter sets, aiming at the quantum security of 128, 192, and 256 bits (actually achieving 129, 197, and 276 bits) with matching and negligible error probabilities. When compared to Kyber, our Tyber exhibits stronger quantum security, by 22, 31, and 44 bits, than Kyber for three security levels.
The fast development of quantum computing is a major threat to the classical cryptographic systems and the emergence of secure and efficient post-quantum cryptographic (PQC) is required.Lattice-based cryptography is one of the potential solutions that have been adopted as one of the promising solutions due to its excellent security grounds and quantum resistant nature.Nevertheless, there are difficulties of large key sizes, high computing power and flexibility to diverse application environments that plague existing lattice-based schemes.This paper introduces a new model which combines lattice-theoretic concepts and discrete optimization methods to improve the performance and scalability of PQC systems.Its methodology includes the use of optimization-based key generation, adaptive parameter choice, and using efficient encryption-decryption mechanisms that are based on the Learning With Errors (LWE) problem.Key metrics, such as key size, computation time and error rate, are used to evaluate the comprehensive performance and compared to the known schemes, such as Kyber, NTRU and Saber.Experimental evidence shows that the given model has the smaller key size of 2.4 KB, shorter calculation time of 13.9 ms and smaller error rate of 0.3 that is superior to existing techniques.The results suggest that the suggested framework offers the best compromise in terms of security, performance, and scalability, thus it is applicable to the next-generation secure communication framework in the post-quantum world.