Lune

CRYPTO2025Top-tier venue

Stationary Syndrome Decoding for Improved PCGs

Vladimir Kolesnikov, Stanislav Peceny, Srinivasan Raghuraman, Peter Rindal

2025Year
6Citations
5Top-tier citations

Abstract

Syndrome decoding (SD), and equivalently Learning Parity with Noise (LPN), is a fundamental problem in cryptography, which states that for a field F\mathbb{F}, some compressing public matrix G∈Fk×n\mathbf{G} \in \mathbb{F}^{k\times n}, and a secret sparse vector e∈Fn\mathbf{e} \in\mathbb{F}^{n} sampled from some noise distribution, Ge\mathbf{G}\mathbf{e} is indistinguishable from uniform. Recently, the SD has gained significant interest due to its use in pseudorandom correlation generators (PCGs).

In pursuit of better efficiency, we propose a new assumption called Stationary Syndrome Decoding (SSD). In SSD, we consider qq correlated noise vectors e1,…,eq∈Fn\mathbf{e}_{1},\ldots,\mathbf{e}_{q}\in \mathbb{F}^n and associated instances G1e1,…,Gqeq\mathbf{G}_{1}\mathbf{e}_{1},\ldots,\mathbf{G}_{q}\mathbf{e}_{q} where the noise vectors are restricted to having non-zeros in the same small subset of tt positions L⊂[n]L\subset [n]. That is, for all i∈Li\in L, ej,i\mathbf{e}_{j,i} is uniformly random, while for all other ii, ej,i=0\mathbf{e}_{j,i} = 0.

Although naively reusing the noise vector renders SD and LPN insecure via simple Gaussian elimination, we observe known attacks do not extend to our correlated noise. We show SSD is unconditionally secure against so-called linear attacks, e.g., advanced information set decoding and representation techniques (Esser and Santini, Crypto 2024). We further adapt the state-of-the-art nonlinear attack (Briaud and Oygarden, Eurocrypt 2023) to SSD and demonstrate both theoretically and experimentally resistance to the attack.

We apply SSD to PCGs to amortize the cost of noise generation protocol. For OT and VOLE generation, each instance requires O(t)O(t) communication instead of O(tlog⁡n)O(t\log n). For suggested parameters, we observe a 1.5×1.5\times improvement in the running time or between 6 and 18×18\times reduction in communication. For Beaver triple generation using Ring LPN, our techniques have the potential for substantial amortization due to the high concrete overhead of the Ring LPN noise generation.

Ask about this paper

Ask your agent about it.

Lune has read the top-tier papers around this one, so every answer names the papers it rests on.

Questions to start from

Your agent calls

Lunesearch_papers

Ask in Lune

Free to start. No credit card required.

lune papers get 39ecb898-0a8d-4206-96f7-55b99c87d335

Cited by top-tier papers5

Ask how each one uses it

Related papers

Dusk over the sea between two cliffs drawn in fine vertical lines