Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing
© International Association for Cryptologic Research 2019. We present a worst case decoding problem whose hardness reduces to that of solving the Learning Parity with Noise (LPN) problem, in some parameter regime. Prior to this work, no worst case hardness result was known for LPN (as opposed to syn...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Springer International Publishing,
2022-02-04T20:50:56Z.
|
| Subjects: | |
| Online Access: | Get fulltext |