Algebraically structured LWE. Revisited
From MaRDI portal
Publication:2175901
Recommendations
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- A decade of lattice cryptography
- 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, 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?)
- Large modulus ring-LWE \(\geq \) module-LWE
- Middle-product Learning with Errors
- On error distributions in ring-based LWE
- 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
- Pseudorandomness of ring-LWE for any ring and modulus
- Public-key cryptosystems from the worst-case shortest vector problem
- Worst-case to average-case reductions for module lattices
Cited in
(23)- LWE from non-commutative group rings
- Rounding in the rings
- A trace map attack against special ring-LWE samples
- Universal product learning with errors: a new variant of \textsf{LWE} for lattice-based cryptography
- Making the BKW algorithm practical for LWE
- Non-commutative ring learning with errors from cyclic algebras
- On the hardness of module learning with errors with short distributions
- Revisiting the Security of the ALRED Design and Two of Its Variants: Marvin and LetterSoup
- Batch bootstrapping. I: A new framework for SIMD bootstrapping in polynomial modulus
- Hardness of (M)LWE with semi-uniform seeds
- Concrete analysis of approximate ideal-SIVP to decision ring-LWE reduction
- Algebraically structured LWE, revisited
- Middle-products of skew polynomials and learning with errors
- On algebraic embedding for unstructured lattices
- TFHE public-key encryption revisited
- On the quantum security of high-dimensional RSA protocol
- Learning with errors over group rings constructed by semi-direct product
- More efficient functional bootstrapping for general functions in polynomial modulus
- Algebraic equipage for learning with errors in cyclic division algebras
- A note on short invertible ring elements and applications to cyclotomic and trinomials number fields
- REFHE: fully homomorphic ALU
- Hardness of M-LWE with general distributions and applications to leaky variants
- SoK: how (not) to design and implement post-quantum cryptography
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 Q2175901)