MathDB

Worst-case to average-case hardness reduction for the Learning Parity with Noise problem

Decide whether average-case hardness of Learning Parity with Noise in the standard constant-noise regime can be established by a worst-case-to-average-case reduction from a worst-case decoding problem.

Source: Aggarwal, D., Gupta, R., Nguyen, H.H., Tan, K.Z., Vasudevan, P.N. (2026). Towards Worst-case Hardness for Low-Noise LPN. IACR Cryptology ePrint Archive, Report 2026/1168..

Status Open Status review date not recorded in this edition

Listed by ProofAtlas. Status qualification is attributed to ProofAtlas; no full resolution is certified here.

References

Primary source

ProofAtlas open problems; Aggarwal, D., Gupta, R., Nguyen, H.H., Tan, K.Z., Vasudevan, P.N. (2026). Towards Worst-case Hardness for Low-Noise LPN. IACR Cryptology ePrint Archive, Report 2026/1168.

information-theory
Posted

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.