Skip to content
Sagan

Paper

Towards Worst-case Hardness for Low-Noise LPN

Unreadunread

AI summary

arXiv:2606. 05834v1 Announce Type: new Abstract: 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 to public-key encryption and beyond.