Using Learning with Rounding to Instantiate Post-Quantum Cryptographic Algorithms

Andrea Basso

doi:10.1145/3807514

Using Learning with Rounding to Instantiate Post-Quantum Cryptographic Algorithms

2026-07-08

0

OA

AI

Jose Maria Bermudo Mera

DOI：10.1145/3807514

Original request for help

Save

Abstract

En 中文

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.

Keywords:

Post-quantum cryptography,learning with rounding,lattice-based cryptography

Using Learning with Rounding to Instantiate Post-Quantum Cryptographic Algorithms

Abstract

Journal

Organization

Cited Papers