On algebraic embedding for unstructured lattices
From MaRDI portal
(Redirected from Publication:6635822)
Recommendations
Cites work
- A decade of lattice cryptography
- A toolkit for ring-LWE cryptography
- Algebraically structured LWE. Revisited
- An efficient and parallel Gaussian sampler for lattices
- Approx-SVP in ideal lattices with pre-processing
- Efficient public key encryption based on ideal lattices (extended abstract)
- Generalized Compact Knapsacks Are Collision Resistant
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 3760283 (Why is no real title available?)
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 1313469 (Why is no real title available?)
- Log-\(\mathcal{S}\)-unit lattices using explicit Stickelberger generators to solve approx ideal-SVP
- Middle-product Learning with Errors
- New bounds in some transference theorems in the geometry of numbers
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On lattices, learning with errors, random linear codes, and cryptography
- On the ideal shortest vector problem over random rational primes
- On the ring-LWE and polynomial-LWE problems
- On the shortness of vectors to be found by the ideal-SVP quantum algorithm
- Order-LWE and the hardness of ring-LWE with entropic secrets
- Recovering short generators of principal ideals in cyclotomic rings
- Short Stickelberger class relations and application to Ideal-SVP
- Some easy instances of ideal-SVP and implications on the partial Vandermonde knapsack problem
- Theory of Cryptography
- Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices
This page was built for publication: On algebraic embedding for unstructured lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635822)