Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:
ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Home/Authors/Rishav Gupta

Rishav Gupta

2 indexed papers

Recent (6 mo)
2
With code
0
Influential cites
0
Benchmarked
0

Publications per year

2
26

Top categories

Crypto×2Complexity×1

Frequent co-authors

Divesh Aggarwal2×
Hai Hoang Nguyen1×
Kel Zin Tan1×
Prashant Nalini Vasudevan1×
Li Zeyong1×

Research Timeline

2026
Hardness Amplification for (Sparse) LPN

The paper establishes new hardness amplification results for Learning Parity with Noise (LPN) and its sparse variants, showing that solving the problem on a small fraction of instances implies solving it on almost all instances.

Towards Worst-case Hardness for Low-Noise LPN

The paper presents a new worst-case to average-case reduction for the Learning Parity with Noise (LPN) problem, achieving hardness for inverse-polynomial noise rates previously unattainable.

Highlighted terms show continued research focus across papers

Papers

cs.CRRecentJun 4, 2026

Towards Worst-case Hardness for Low-Noise LPN

Divesh Aggarwal, Rishav Gupta, Hai Hoang Nguyen, Kel Zin Tan +1 more

The paper presents a new worst-case to average-case reduction for the Learning Parity with Noise (LPN) problem, achieving hardness for inverse-polynomial noise rates previously unattainable.

View →
cs.CRcs.CCRecentMay 11, 2026

Hardness Amplification for (Sparse) LPN

Divesh Aggarwal, Rishav Gupta, Li Zeyong

The paper establishes new hardness amplification results for Learning Parity with Noise (LPN) and its sparse variants, showing that solving the problem on a small fraction of instances implies solving…

View →