Hardness Amplification for (Sparse) LPN

Divesh Aggarwal, Rishav Gupta, Li Zeyong

We prove new hardness amplification results for Learning Parity with Noise ($\mathsf{LPN}$) and its sparse variants. In ${\mathsf{LPN}}_{\hat{I}\cdot ,n,m}$, the goal is to recover a secret $\v…