Using Learning with Rounding to Instantiate Post-Quantum Cryptographic Algorithms
ACM Transactions on Embedded Computing Systems · 31.07.2026 · 25 (4) · 1-33
DOI: 10.1145/3807514 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Transactions on Embedded Computing Systems, online erschienen am 08.07.2026. Verfasst von Andrea Basso und 11 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 121 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
The Learning with Rounding (LWR) problem, introduced as a deterministic variant of Learning with Errors (LWE), has become a promising foundation for post-quantum cryptography. This Systematization of Knowledge (SoK) article presents a comprehensive survey of the theoretical foundations, algorithmic developments, and practical implementations of LWR-based cryptographic schemes. We introduce LWR within the broader landscape of lattice-based cryptography and post-quantum security, highlighting its advantages such as reduced randomness, improved efficiency, and enhanced side-channel resistance. We explore the evolution of security reductions from LWR to LWE, including recent advances that support practical parameter regimes and address challenges in both bounded and unbounded sample settings. This article systematically reviews existing LWR-based schemes — including Saber, Lizard, Florete, Espada, Sable, and SMAUG — analyzing their design choices, parameter sets, and performance tradeoffs. Furthermore, we examine the impact of LWR on side-channel resistance, failure probabilities, and masking efficiency, demonstrating its suitability for secure and efficient implementations. By consolidating the research spanning theory and practice, this SoK aims at guiding future cryptographic design and standardization efforts leveraging LWR.
Zitieren
APA
Basso, A., Bos, J., D’Anvers, J., Karmakar, A., Mera, J. B., Renes, J., Roy, S., Vercauteren, F., Wang, P., Wang, Y., Zhang, S., & Zhong, C. (2026). Using Learning with Rounding to Instantiate Post-Quantum Cryptographic Algorithms. ACM Transactions on Embedded Computing Systems, 25(4), 1-33. https://doi.org/10.1145/3807514
Vancouver
Basso A, Bos J, D’Anvers J, Karmakar A, Mera JB, Renes J, et al. Using Learning with Rounding to Instantiate Post-Quantum Cryptographic Algorithms. ACM Transactions on Embedded Computing Systems. 2026;25(4):1-33. doi:10.1145/3807514
BibTeX
@article{Basso2026,
author = {Basso, Andrea and Bos, Joppe and D’Anvers, Jan-Pieter and Karmakar, Angshuman and Mera, Jose Bermudo and Renes, Joost and Roy, Sujoy and Vercauteren, Frederik and Wang, Peng and Wang, Yuewu and Zhang, Shicong and Zhong, Chenxin},
title = {Using Learning with Rounding to Instantiate Post-Quantum Cryptographic Algorithms},
journal = {ACM Transactions on Embedded Computing Systems},
year = {2026},
volume = {25},
number = {4},
pages = {1--33},
doi = {10.1145/3807514}
}
EUVIMED