Showing cs.CRShow all
2 papers · 1 filter
cs.CR2026
Towards Worst-case Hardness for Low-Noise LPN
Divesh Aggarwal, Rishav Gupta, Hai Hoang Nguyen +2
The hardness of the Learning Parity with Noise (LPN) problem is a foundational assumption in cryptography, forming the basis of constructions ranging from symmetric-key primitives…
cs.CR2026
Hardness Amplification for (Sparse) LPN
Divesh Aggarwal, Rishav Gupta, Li Zeyong
We prove new hardness amplification results for Learning Parity with Noise () and its sparse variants. In , the goal is to recover a secret $\v…