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

International Journal on Advanced Computer Theory and Engineering

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

Published Oct 20, 2025• 0 citations
Publisher

Abstract

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.

DOI
10.65521/ijacte.v14i2.2126

Related papers

Lattice-Induced Key Exchange with Optimized Polynomial Sampling

Dipesh Bhaurao Pardeshi

This paper introduces an optimized policy on using polynomials sampling strategy in lattice-based key exchange protocols based on the hardness of Ring-LWE and Module-LWE. The suggested approach presents a discrete distribution that is refined and minimizes the rejection probability without loss of statistical indistinguishability and cryptographic security. The scheme combines inverse transform sampling with variable control bound that is constrained, and thus, it minimizes computation loads that are required by the conventional Gaussian sampling schemes. Compared to 148 µs sampling time and 7.8% rejection rate, experimental assessment shows that sampling time has been reduced by a factor of 32.6 (92 µs) and the rejection rate has decreased by 2.9 (2.9). The methodology retains the same degree of the polynomials and security assurances and enhances resource-constrained performance. When compared, improved performance is established at the expense of traditional sampling mechanisms without sacrificing the post-quantum resilience. The suggested optimization can be applied to real-time cryptographic implementations in IoT and embedded-systems that need low-latency secure communication.

Journal of Intelligent Decision Making and Information Science•Jul 23, 2026•0 citations

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

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

Joppe W. Bos, Joost Renes, Fréderik Vercauteren +1 more

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.

IACR Transactions on Cryptographic Hardware and Embedded Systems•Jul 17, 2026•1 citation

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 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

Design and Analysis of Post Quantum Secure Ideal Lattice Based Key Encapsulation Mechanism for Mobile Communication System

Pradeep Kumar Dadsena, Madireddy H. V. S. P. Reddy, Saurabh Rana +3 more

Post Quantum Key Encapsulation Mechanism (PKEM) is used to securely exchange symmetric keys over an insecure channel. It allows two parties to establish a shared secret key, which can then be used for symmetric encryption, ensuring confidentiality against quantum attacks. By encapsulating the key, it reduces the need to directly encrypt large amounts of data with the public key, which is computationally expensive. Traditional cryptographic tools, while effective, are complex and susceptible to quantum attacks. This paper contains a robust and lightweight post-quantum security solution, and their performance analysis. The authentication scheme, based on Ring-Learning with Errors (Ring-LWE), uses Bernstein reconstruction in polynomial multiplication to significantly lower computational costs, enabling even resource-limited mobile devices to achieve secure mutual authentication. This paper also contains an analysis of post-quantum key encapsulation mechanism (PKEM), and it also covers design, security, and real-world implementation issues and provides a prospective outlook on PKEM, taking into account current investigations, possible innovations, and the changing field of quantum computing. The proposed work also offers a thorough investigation of the security features of post-quantum KEMs, together with theoretical and practical concerns.

International Conference on Innovative Sustainable Computational Technologies (CISCT)•Dec 27, 2024•0 citations
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.
This paper introduces an optimized policy on using polynomials sampling strategy in lattice-based key exchange protocols based on the hardness of Ring-LWE and Module-LWE. The suggested approach presents a discrete distribution that is refined and minimizes the rejection probability without loss of statistical indistinguishability and cryptographic security. The scheme combines inverse transform sampling with variable control bound that is constrained, and thus, it minimizes computation loads that are required by the conventional Gaussian sampling schemes. Compared to 148 µs sampling time and 7.8% rejection rate, experimental assessment shows that sampling time has been reduced by a factor of 32.6 (92 µs) and the rejection rate has decreased by 2.9 (2.9). The methodology retains the same degree of the polynomials and security assurances and enhances resource-constrained performance. When compared, improved performance is established at the expense of traditional sampling mechanisms without sacrificing the post-quantum resilience. The suggested optimization can be applied to real-time cryptographic implementations in IoT and embedded-systems that need low-latency secure communication.
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.
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.
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.
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.
Post Quantum Key Encapsulation Mechanism (PKEM) is used to securely exchange symmetric keys over an insecure channel. It allows two parties to establish a shared secret key, which can then be used for symmetric encryption, ensuring confidentiality against quantum attacks. By encapsulating the key, it reduces the need to directly encrypt large amounts of data with the public key, which is computationally expensive. Traditional cryptographic tools, while effective, are complex and susceptible to quantum attacks. This paper contains a robust and lightweight post-quantum security solution, and their performance analysis. The authentication scheme, based on Ring-Learning with Errors (Ring-LWE), uses Bernstein reconstruction in polynomial multiplication to significantly lower computational costs, enabling even resource-limited mobile devices to achieve secure mutual authentication. This paper also contains an analysis of post-quantum key encapsulation mechanism (PKEM), and it also covers design, security, and real-world implementation issues and provides a prospective outlook on PKEM, taking into account current investigations, possible innovations, and the changing field of quantum computing. The proposed work also offers a thorough investigation of the security features of post-quantum KEMs, together with theoretical and practical concerns.