Algebraically structured LWE, revisited
From MaRDI portal
Recommendations
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- A decade of lattice cryptography
- Algebraically structured LWE. Revisited
- Algorithmic methods for finitely generated Abelian groups
- Classical hardness of learning with errors
- Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings
- Efficient public key encryption based on ideal lattices (extended abstract)
- Generalized Compact Knapsacks Are Collision Resistant
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- How (not) to instantiate ring-LWE
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 43569 (Why is no real title available?)
- scientific article; zbMATH DE number 611919 (Why is no real title available?)
- Large modulus ring-LWE \(\geq \) module-LWE
- Middle-product Learning with Errors
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On the ring-LWE and polynomial-LWE problems
- Order-LWE and the hardness of ring-LWE with entropic secrets
- Practical \(\mathsf{MP} \text{- }\mathsf{LWE}\)-based encryption balancing security-risk versus efficiency
- Provably weak instances of ring-LWE revisited
- Pseudorandomness of ring-LWE for any ring and modulus
- Public-key cryptosystems from the worst-case shortest vector problem
- Ring-LWE in polynomial rings
- Theory of Cryptography
- Worst-case to average-case reductions for module lattices
Cited in
(3)
This page was built for publication: Algebraically structured LWE, revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6595844)
