On algebraic embedding for unstructured lattices
From MaRDI portal
Publication:6635822
DOI10.1007/978-3-031-57725-3_5MaRDI QIDQ6635822
Madalina Bolboceanu, Devika Sharma, Zvika Brakerski
Publication date: 12 November 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- New bounds in some transference theorems in the geometry of numbers
- On the ring-LWE and polynomial-LWE problems
- Middle-product Learning with Errors
- On the ideal shortest vector problem over random rational primes
- Algebraically structured LWE. Revisited
- Order-LWE and the hardness of ring-LWE with entropic secrets
- On the shortness of vectors to be found by the ideal-SVP quantum algorithm
- Approx-SVP in ideal lattices with pre-processing
- Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices
- A decade of lattice cryptography
- On Ideal Lattices and Learning with Errors over Rings
- An Efficient and Parallel Gaussian Sampler for Lattices
- Generalized Compact Knapsacks Are Collision Resistant
- Efficient Public Key Encryption Based on Ideal Lattices
- A Toolkit for Ring-LWE Cryptography
- Short Stickelberger Class Relations and Application to Ideal-SVP
- Recovering Short Generators of Principal Ideals in Cyclotomic Rings
- Theory of Cryptography
- On lattices, learning with errors, random linear codes, and cryptography
- On lattices, learning with errors, random linear codes, and cryptography
- Some easy instances of ideal-SVP and implications on the partial Vandermonde knapsack problem
- Log-\(\mathcal{S}\)-unit lattices using explicit Stickelberger generators to solve approx ideal-SVP
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)
