An extension of Kannan's embedding for solving ring-based LWE problems
From MaRDI portal
Publication:2149793
Recommendations
- An experimental study of Kannan's embedding technique for the search LWE problem
- Solving the search-LWE problem over projected lattices
- Learning with errors over rings. (Abstract)
- Provably weak instances of Ring-LWE
- Algebraic aspects of solving ring-LWE, including ring-based improvements in the Blum-Kalai-Wasserman algorithm
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- A survey of solving SVP algorithms and recent strategies for solving the SVP challenge
- Determinants of block tridiagonal matrices
- Efficient public key encryption based on ideal lattices (extended abstract)
- Estimate all the \(\{\)LWE, NTRU\(\}\) schemes!
- Factoring polynomials with rational coefficients
- Hermite’s Constant and Lattice Algorithms
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 1962809 (Why is no real title available?)
- Improved progressive BKZ algorithms and their precise cost estimation by sharp simulator
- Lattice attacks on NTRU and LWE: a history of refinements
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Lattice decoding attacks on binary LWE
- Lattice enumeration using extreme pruning
- Lattice-based Cryptography
- Minkowski's Convex Body Theorem and Integer Programming
- On error distributions in ring-based LWE
- On ideal lattices and learning with errors over rings
- On the concrete hardness of learning with errors
- On the success probability of solving unique SVP via BKZ
- Revisiting the expected cost of solving uSVP and applications to LWE
- Second order statistical behavior of LLL and BKZ
- Worst-case to average-case reductions for module lattices
Cited in
(6)- Ring-LWE: applications to cryptography and their efficient realization
- Solving the search-LWE problem over projected lattices
- An experimental study of Kannan's embedding technique for the search LWE problem
- Algebraic aspects of solving ring-LWE, including ring-based improvements in the Blum-Kalai-Wasserman algorithm
- Revisiting the Sparsification Technique in Kannan’s Embedding Attack on LWE
- Refined modelling of the primal attack, and variants against Module-LWE
This page was built for publication: An extension of Kannan's embedding for solving ring-based LWE problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2149793)
