Revisiting the hardness of binary error LWE

DOI10.1007/978-3-030-55304-3_22zbMath1464.68122OpenAlexW3037462611MaRDI QIDQ2030882

Yanyan Li

Publication date: 8 June 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-55304-3_22

zbMATH Keywords

algebraic attacksMacaulay matrixsample complexitybinary error LWEcomplexity tradeoffslossy function family

Mathematics Subject Classification ID

Computational learning theory (68Q32) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

On the hardness of module learning with errors with short distributions ⋮ A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions ⋮ Hardness of (M)LWE with semi-uniform seeds ⋮ Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification

This page was built for publication: Revisiting the hardness of binary error LWE