Recommendations
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- A toolkit for ring-LWE cryptography
- Classical hardness of learning with errors
- Entropic hardness of Module-LWE from module-NTRU
- Functional encryption for inner product predicates from learning with errors
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Hardness of LWE on general entropic distributions
- High-dimensional probability. An introduction with applications in data science
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Indistinguishability obfuscation from well-founded assumptions
- Large modulus ring-LWE \(\geq \) module-LWE
- Learning with rounding, revisited. New reduction, properties and applications
- Lossiness and entropic hardness for ring-LWE
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On the hardness of module-LWE with binary secret
- On the ring-LWE and polynomial-LWE problems
- Order-LWE and the hardness of ring-LWE with entropic secrets
- Pseudorandomness of ring-LWE for any ring and modulus
- Public-key cryptosystems from the worst-case shortest vector problem
- Rounding in the rings
- Towards classical hardness of module-LWE: the linear rank case
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Worst-case to average-case reductions for module lattices
Cited in
(4)
This page was built for publication: Hardness of entropic module-LWE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496885)
