Pages that link to "Item:Q2030882"
From MaRDI portal
The following pages link to Revisiting the hardness of binary error LWE (Q2030882):
Displaying 11 items.
- On the asymptotic complexity of solving LWE (Q1692148) (← links)
- Verifying solutions to LWE with implications for concrete security (Q2025364) (← links)
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification (Q2056782) (← links)
- On the complexity of the BKW algorithm on LWE (Q2256097) (← links)
- Error analysis of weak poly-LWE instances (Q2632837) (← links)
- On the hardness of module learning with errors with short distributions (Q2677644) (← links)
- On the hardness of learning with errors with binary secrets (Q4612477) (← links)
- Lattice Decoding Attacks on Binary LWE (Q5170784) (← links)
- Entropic hardness of Module-LWE from module-NTRU (Q6169458) (← links)
- Hardness of (M)LWE with semi-uniform seeds (Q6204543) (← links)
- The complexity of algebraic algorithms for LWE (Q6637336) (← links)