aiqbench analysis
This paper proposes a new post-quantum assumption, LAR, which builds pseudorandomness from deterministic rounding rather than the randomized rounding used in LWR. Its security is tied to worst-case lattice problems (GapSVP and SIVP) at approximation factor O(q), which is a stronger foundation than ad-hoc assumptions, though the claims rest on a multi-step reduction that specialists will need to verify. For readers tracking post-quantum cryptography, the notable points are fixed polynomial parameters and a claimed TC^0 implementation, which matter for efficiency, but this is a theoretical result and not yet a deployable standard.
New lattice assumption, LAR, links rounding to quantum-resistant encryption
New research introduces the Learning with Algebraic Rounding (LAR) assumption, connecting deterministic rounding to worst-case lattice hardness.
Chen Qian of Shandong University has introduced the Learning with Algebraic Rounding (LAR) assumption, a new approach to achieving post-quantum pseudorandomness through deterministic rounding. The work demonstrates that this method can achieve security with fixed polynomial parameters, removing a key limitation of previous (LWR) techniques that required parameters tailored to a predetermined sample bound. LAR bases its security on the hardness of established lattice problems, GapSVP and SIVP, at approximation factor O(q), where q is the modulus. This establishes a quantifiable security basis for the new method and offers “the first post-quantum weak pseudorandom function with joint key-and-input evaluation in TC^0.” The core of LAR lies in its algebraic rounding function, denoted ART, which takes an input vector x from Zd, performs element-wise division and flooring operations modulo q, and outputs a rounded vector in Zd. This process inherently introduces deterministic information loss, but the work demonstrates this loss is sufficient for post-quantum pseudorandomness under specific conditions. Specifically, the rounded output determines a coset in Z^d/L(T), where L(T) represents a lattice, and Smith…
Excerpt shown under the publisher's RSS terms · 173 words · full text and figures are on the publisher's site