Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN (Q2129007)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN |
scientific article |
Statements
Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN (English)
0 references
22 April 2022
0 references
foundations of cryptography
0 references
worst-case to average-case reduction
0 references
learning parity with noise
0 references
smoothing lemma
0 references
0 references
0 references
