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 International Conference on Public Key Infrastructure and its Applications (PKIA)

Lightweight and Efficient Module-LWE Identity-Based Encryption Scheme for Post-Quantum Security

Kamna Sahu, Srinivasa KG, Satyanarayana Vollala

Published Sep 3, 2025• 0 citations
Publisher
DOI
10.1109/pkia67529.2025.11347140

Related papers

An Identity-Based Fully Homomorphic Encryption from Module-LWE

Shan Ma, YiChen Li, Chunyu Qiu

•Jan 1, 2026•0 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

A practical study of post-quantum enhanced identity-based encryption

Dariia Verchyk, Johanna Sepúlveda

Microprocessors and Microsystems•Apr 21, 2023•11 citations

A Hybrid Module-LWE and Hash-Based Framework for Memory-Efficient Post-Quantum Key Encapsulation

Elmin Marevac, Esad Kadušić, Nataša Živić +2 more

Deploying post-quantum cryptography on highly constrained devices remains challenging due to the large key sizes and substantial storage and memory-traffic demands of leading lattice-based schemes. Although constructions such as Kyber, Dilithium, and NTRU offer strong resistance against quantum adversaries, their multi-kilobyte public keys and intensive memory access patterns limit practical adoption in microcontrollers, smart cards, and low-power edge environments. This work proposes a hybrid key-encapsulation mechanism that integrates a compact, seed-generated Module-LWE structure with a quantum-secure hash-based authentication layer. The design employs a small public seed to instantiate lattice matrices on demand via a lightweight pseudorandom generator and incorporates a Merkle-tree commitment to represent compressed auxiliary error information. Additional design considerations—including sparsity-aware secret keys, SIMD-friendly polynomial operations, and cache-efficient decryption paths—are intended to reduce runtime memory usage and computational overhead. The security of the proposed construction is analysed under both Module-LWE and hash-based one-way assumptions, with further consideration of constant-time execution and cache-line alignment to mitigate side-channel risks. This hybrid approach outlines a design pathway toward post-quantum key-encapsulation mechanisms suitable for deployment on memory-limited and energy-constrained platforms.

Cryptography•May 3, 2026•0 citations

Post-quantum key exchange based on ring-LWE

van Mpp Maran Heesch

•Jan 1, 2016•0 citations

Ensuring Confidentiality in Future Systems with Advanced Post-Quantum Cryptographic Solutions

Purvi Pareek, Mahesh Soni, Sowjanya Karri +3 more

This research paper addresses the growing challenge of maintaining data confidentiality in a future where quantum-enabled attackers can undermine the cryptographic foundations of existing security systems. While emerging post-quantum standards mainly aim to replace classical public-key primitives, they leave critical gaps in managing symmetric key lifecycles, enabling secure encrypted search, and supporting multi-party access control. To bridge these gaps, this work proposes a unified post-quantum confidentiality framework built on a punctual-ratchet lattice-based encapsulation scheme. The design combines module-LWE key encapsulation with a punctual symmetric ratchet, establishing a quantum-resistant bootstrap secret and enabling continuous forward secrecy. Key evolution is achieved through a puncturable PRF mechanism that allows selective invalidation of prior decryption keys with minimal overhead and compact verifiability. Using the same ratchet state, an encrypted indexing layer is constructed to support efficient, privacy-preserving querying across large ciphertext repositories while limiting long-term query pattern leakage. The framework preserves confidentiality even when devices face delayed compromise, and it scales effectively through lightweight client-side rekey capsules compatible with high-throughput infrastructures. Experimental results show that encapsulation costs can be amortized, ratchet steps remain lightweight, and metadata growth stays sublinear. Overall, the proposed system provides a practical and secure foundation for future post-quantum cybersecurity architectures.

International Conference Communication, Networks & Computing•Dec 29, 2025•0 citations
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.
Deploying post-quantum cryptography on highly constrained devices remains challenging due to the large key sizes and substantial storage and memory-traffic demands of leading lattice-based schemes. Although constructions such as Kyber, Dilithium, and NTRU offer strong resistance against quantum adversaries, their multi-kilobyte public keys and intensive memory access patterns limit practical adoption in microcontrollers, smart cards, and low-power edge environments. This work proposes a hybrid key-encapsulation mechanism that integrates a compact, seed-generated Module-LWE structure with a quantum-secure hash-based authentication layer. The design employs a small public seed to instantiate lattice matrices on demand via a lightweight pseudorandom generator and incorporates a Merkle-tree commitment to represent compressed auxiliary error information. Additional design considerations—including sparsity-aware secret keys, SIMD-friendly polynomial operations, and cache-efficient decryption paths—are intended to reduce runtime memory usage and computational overhead. The security of the proposed construction is analysed under both Module-LWE and hash-based one-way assumptions, with further consideration of constant-time execution and cache-line alignment to mitigate side-channel risks. This hybrid approach outlines a design pathway toward post-quantum key-encapsulation mechanisms suitable for deployment on memory-limited and energy-constrained platforms.
This research paper addresses the growing challenge of maintaining data confidentiality in a future where quantum-enabled attackers can undermine the cryptographic foundations of existing security systems. While emerging post-quantum standards mainly aim to replace classical public-key primitives, they leave critical gaps in managing symmetric key lifecycles, enabling secure encrypted search, and supporting multi-party access control. To bridge these gaps, this work proposes a unified post-quantum confidentiality framework built on a punctual-ratchet lattice-based encapsulation scheme. The design combines module-LWE key encapsulation with a punctual symmetric ratchet, establishing a quantum-resistant bootstrap secret and enabling continuous forward secrecy. Key evolution is achieved through a puncturable PRF mechanism that allows selective invalidation of prior decryption keys with minimal overhead and compact verifiability. Using the same ratchet state, an encrypted indexing layer is constructed to support efficient, privacy-preserving querying across large ciphertext repositories while limiting long-term query pattern leakage. The framework preserves confidentiality even when devices face delayed compromise, and it scales effectively through lightweight client-side rekey capsules compatible with high-throughput infrastructures. Experimental results show that encapsulation costs can be amortized, ratchet steps remain lightweight, and metadata growth stays sublinear. Overall, the proposed system provides a practical and secure foundation for future post-quantum cybersecurity architectures.