On the combinatorial complexity of bounded sparse learning with errors (sLWE)
From MaRDI portal
Cites work
- A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- A systematic study of sparse LWE
- Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys
- Efficient public key encryption based on ideal lattices (extended abstract)
- Fully homomorphic encryption using ideal lattices
- High-precision bootstrapping for approximate homomorphic encryption by error variance minimization
- High-precision bootstrapping of RNS-CKKS homomorphic encryption using optimal minimax polynomial approximation and inverse sine function
- How to meet ternary LWE keys
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- Lattice signatures and bimodal Gaussians
- Lattice signatures without trapdoors
- NTRU prime: reducing attack surface at low cost
- On lattices, learning with errors, random linear codes, and cryptography
- On the concrete hardness of learning with errors
- Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
- Public-key cryptosystems from the worst-case shortest vector problem
- Round5: compact and fast post-quantum public-key encryption
This page was built for publication: On the combinatorial complexity of bounded sparse learning with errors (sLWE)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363330)
