A new reduction shows k-sparse LWE and LPN in dimension n inherit nearly the full hardness of dense LWE and LPN in a much smaller dimension.
An improved algorithm for learning sparse parities in the presence of noise
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2024 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations
A new reduction shows k-sparse LWE and LPN in dimension n inherit nearly the full hardness of dense LWE and LPN in a much smaller dimension.