大模下含噪线性方程的样本保留型搜索到决策归约
Sample-Preserving Search-to-Decision Reduction for Noisy Linear Equations over Large Moduli
AI总结:
本文针对大模下含噪线性方程提出样本保留型搜索到决策归约,复杂度为poly(n,m,log q, q/σ),可实现LWE、LWR的高效归约,解决了此前归约的参数不保留或复杂度过高的问题。
摘要:
含噪线性方程问题是指在给定含噪评估结果的有限域上求解随机线性方程组,它是密码学中广泛使用的各类学习问题的泛化,包括带误差学习(Learning with Errors, LWE)、舍入学习(Learning with Rounding, LWR)和带噪声的奇偶学习(Learning Parity with Noise, LPN)。本文提出了一种针对含噪线性方程的新型样本保留型搜索到决策归约,其复杂度为poly(n,m,log q, q/σ),其中n为秘密维度,m为样本数量,q为模,σ为噪声幅度(根据涉及的噪声类型适当定义)。特别地,这意味着即使模q呈指数级大,只要噪声与模的比值σ/q不可忽略,针对LWE和LWR的搜索到决策归约也能在poly(n)时间内运行。该归约适用于素模q;若q为合数,则会生成一个包含解的小倍数的列表。在本研究之前,已知的针对LWE和LWR的搜索到决策归约要么不保留问题参数(即m、n、σ和q),要么其复杂度与σ或q的最大素因子呈多项式比例增长。
英文摘要:
The Noisy Linear Equations problem involves finding the solution to a random linear system over a finite field given noisy evaluations. This is a generalisation of various learning problems widely used in cryptography, including Learning with Errors (LWE), Learning with Rounding (LWR), and Learning Parity with Noise (LPN). We present a new sample-preserving search-to-decision reduction for Noisy Linear Equations that has complexity $\mathrm{poly}(n,m,\log q, q/σ)$, where $n$ is the dimension of the secret, $m$ is the number of samples, $q$ is the modulus, and $σ$ is the magnitude of the noise (defined suitably for the kind of noise involved). In particular, this implies search-to-decision reductions for LWE and LWR that run in time $\mathrm{poly}(n)$ even if the modulus $q$ is exponentially large, as long as the noise-to-modulus ratio $σ/q$ is non-negligible. Our reduction works for prime moduli $q$. If $q$ is composite, it instead produces a list that contains a small multiple of the solution. Prior to this work, known search-to-decision reductions for LWE and LWR either did not preserve the parameters of the problem (i.e., $m$, $n$, $σ$, and $q$), or had complexity that scaled polynomially with either $σ$ or the largest prime factor of $q$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。