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

Journal of Computer Research and Development

Comparisons and Optimizations of Key Encapsulation Mechanisms Based on Module Lattices

Yang Wang, Shen Shiyu, Yunlei Zhao, Mingqiang Wang

Published Oct 1, 2020• 1 citation
Publisher
DOI
10.7544/issn1000-1239.2020.20200452

Related papers

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

Chik How Tan, Theo Fanuela Prabowo

Lecture notes in computer science•Jan 1, 2021•1 citation

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 +5 more

IEEE Access•Jan 1, 2026•4 citations

SMAUG: Pushing Lattice-Based Key Encapsulation Mechanisms to the Limits

Jung Hee Cheon, Hyeongmin Choe, Dongyeon Hong +1 more

Lecture notes in computer science•Jan 1, 2024•16 citations

Comparison of security arguments of promising key encapsulation mechanisms

Yu.I. Gorbenko, Serhii Kandii

The study of key encapsulation mechanisms on algebraic lattices is one of the important directions in modern post-quantum cryptography, since many mechanisms are already either standardized (ANSI X.9.98, DSTU 8961:2019 "Skelya") or are promising candidates for standardization (CRYSTALS-Kyber, FrodoKEM). The purpose of this work is to compare the security arguments of DSTU 8961:2019 "Skelya", CRYSTALS-Kyber, FrodoKEM key encapsulation mechanisms. The paper provides a comparison of theoretical evidence in the idealized random oracle (ROM) and quantum random oracle (QROM) models, as well as a comparison of specific values ​of security parameters in the core-SVP model, which is, in fact, a standard for lattice cryptography. Since all three key encapsulation mechanisms are based on different complex problems (NTRU, Module-LWE, LWE), a comparison of complex lattice theory problems and a comparison of their security arguments are additionally given. The strengths and weaknesses of the considered key encapsulation mechanisms are shown, and areas of research that require more detailed attention are highlighted.

Radiotekhnika•Sep 28, 2022•2 citations

Identification Schemes from Key Encapsulation Mechanisms

Hiroaki Anada, Seiko Arita

Lecture notes in computer science•Jan 1, 2011•10 citations

Lossy Key Encapsulation Mechanism and Its Applications

Yamin Liu, Xianhui Lu, Bao Li +1 more

Lecture notes in computer science•Jan 1, 2017•1 citation
The study of key encapsulation mechanisms on algebraic lattices is one of the important directions in modern post-quantum cryptography, since many mechanisms are already either standardized (ANSI X.9.98, DSTU 8961:2019 "Skelya") or are promising candidates for standardization (CRYSTALS-Kyber, FrodoKEM). The purpose of this work is to compare the security arguments of DSTU 8961:2019 "Skelya", CRYSTALS-Kyber, FrodoKEM key encapsulation mechanisms. The paper provides a comparison of theoretical evidence in the idealized random oracle (ROM) and quantum random oracle (QROM) models, as well as a comparison of specific values ​of security parameters in the core-SVP model, which is, in fact, a standard for lattice cryptography. Since all three key encapsulation mechanisms are based on different complex problems (NTRU, Module-LWE, LWE), a comparison of complex lattice theory problems and a comparison of their security arguments are additionally given. The strengths and weaknesses of the considered key encapsulation mechanisms are shown, and areas of research that require more detailed attention are highlighted.