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

Lecture notes in computer science

Error-Free Lattice-Based Key Encapsulation Mechanism Based on Ring-LWE

Chik How Tan, Theo Fanuela Prabowo

Published Jan 1, 2021• 1 citation
Publisher
DOI
10.1007/978-3-030-70881-8_11

Related papers

Tightly Secure Ring-LWE Based Key Encapsulation with Short Ciphertexts

Martin R. Albrecht, Emmanuela Orsini, Kenneth G. Paterson +2 more

Lecture notes in computer science•Jan 1, 2017•16 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

An Analysis of Lattice-Based Key Exchange Protocols

Susanne Rieß

•Feb 1, 2016•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

A Novel Key Generation Algorithm Utilizing Lattice-Based Cryptography Principles

Rajakumar Arul, B. Sivaselvam, Ankush Choudhary

Lecture notes in networks and systems•Oct 21, 2024•0 citations

Post-quantum cryptographic schemes using lattice problems

Mohammed Ali Khan, Afreen Khatoon, Hafiz Tariq +1 more

The quick progress of quantum computing is a considerable risk to the classical cryptography of the public key and, the creation of quantum-resistant analogs is necessary.This paper provides a generalized architecture of post-quantum cryptographic schemes, by using lattice problems, especially Learning with Errors (LWE) and Ring-LWE (RLWE).The suggested architecture combines the secure public-key encryption and key encapsulation mechanisms (KEMs) with the implementation in the IoT, blockchain, and cloud setup.An original latticebased encryption design is developed that hybridizes with classical cryptographic primitives to

Journal of Discrete Mathematical Sciences and Cryptography•Oct 31, 2026•0 citations
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.
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.
The quick progress of quantum computing is a considerable risk to the classical cryptography of the public key and, the creation of quantum-resistant analogs is necessary.This paper provides a generalized architecture of post-quantum cryptographic schemes, by using lattice problems, especially Learning with Errors (LWE) and Ring-LWE (RLWE).The suggested architecture combines the secure public-key encryption and key encapsulation mechanisms (KEMs) with the implementation in the IoT, blockchain, and cloud setup.An original latticebased encryption design is developed that hybridizes with classical cryptographic primitives to