Any low-success-probability LPN solver can be transformed into a high-success-probability solver on scaled parameters LPN with noise and dimension divided by k = Θ(1/δ log 1/ε).
Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing , pages=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Hardness Amplification for (Sparse) LPN
Any low-success-probability LPN solver can be transformed into a high-success-probability solver on scaled parameters LPN with noise and dimension divided by k = Θ(1/δ log 1/ε).