On the SVP for low-dimensional circulant lattices
From MaRDI portal
Publication:6645172
DOI10.1007/S10878-024-01183-1MaRDI QIDQ6645172
Renzhang Liu, Yanbin Pan, G. Hu
Publication date: 28 November 2024
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Combinatorial optimization (90C27) Lattices and convex bodies (number-theoretic aspects) (11H06) Mathematical programming (90Cxx) Minima of forms (11H50)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- (Leveled) fully homomorphic encryption without bootstrapping
- Factoring polynomials with rational coefficients
- Geometry of numbers. In two parts, II (last part).
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- Inapproximability of the shortest vector problem: toward a deterministic reduction
- Low-dimensional lattice basis reduction revisited
- Sieve algorithms for the shortest vector problem are practical
- Trapdoors for hard lattices and new cryptographic constructions
- Sieve, Enumerate, Slice, and Lift:
- Fully homomorphic encryption using ideal lattices
- A sieve algorithm for the shortest lattice vector problem
- Random Sampling Revisited: Lattice Enumeration with Discrete Pruning
- Algorithmic Number Theory
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: On the SVP for low-dimensional circulant lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6645172)
