Algebraically structured LWE. Revisited
From MaRDI portal
Publication:2175901
DOI10.1007/978-3-030-36030-6_1zbMath1455.94187OpenAlexW2990927541MaRDI QIDQ2175901
Publication date: 30 April 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-36030-6_1
Related Items (9)
SoK: how (not) to design and implement post-quantum cryptography ⋮ A trace map attack against special ring-LWE samples ⋮ Universal product learning with errors: a new variant of \textsf{LWE} for lattice-based cryptography ⋮ Non-commutative ring learning with errors from cyclic algebras ⋮ On the hardness of module learning with errors with short distributions ⋮ Batch bootstrapping. I: A new framework for SIMD bootstrapping in polynomial modulus ⋮ Hardness of (M)LWE with semi-uniform seeds ⋮ LWE from non-commutative group rings ⋮ Rounding in the rings
Cites Work
- Unnamed Item
- (Leveled) Fully Homomorphic Encryption without Bootstrapping
- On the ring-LWE and polynomial-LWE problems
- Middle-product Learning with Errors
- Order-LWE and the hardness of ring-LWE with entropic secrets
- Worst-case to average-case reductions for module lattices
- Large modulus ring-LWE \(\geq \) module-LWE
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- A Decade of Lattice Cryptography
- How (Not) to Instantiate Ring-LWE
- Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings
- On error distributions in ring-based LWE
- Efficient Public Key Encryption Based on Ideal Lattices
- Pseudorandomness of ring-LWE for any ring and modulus
- Public-key cryptosystems from the worst-case shortest vector problem
- On Ideal Lattices and Learning with Errors over Rings
- Classical hardness of learning with errors
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Algebraically structured LWE. Revisited
