Lattice Point Enumeration on Block Reduced Bases
From MaRDI portal
Recommendations
- Lattice point enumeration and applications
- Bounds for the lattice point enumerator
- Enumeration of lattice points in \(l_1\) norm
- Frobenius numbers by lattice point enumeration
- An upper estimate for the lattice point enumerator
- Asymptotic Formulae for the Lattice Point Enumerator
- scientific article; zbMATH DE number 1192969
- Bounds on the lattice point enumerator via slices and projections
- Rankin’s Constant and Blockwise Lattice Reduction
- Lattice points, Dedekind sums, and Ehrhart polynomials of lattice polyhedra
Cites work
- A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
- A hierarchy of polynomial time lattice basis reduction algorithms
- A sieve algorithm for the shortest lattice vector problem
- Asymptotically Efficient Lattice-Based Digital Signatures
- Better key sizes (and attacks) for LWE-based encryption
- BKZ 2.0: Better lattice security estimates
- Candidate Multilinear Maps from Ideal Lattices
- Factoring polynomials with rational coefficients
- Fast lattice point enumeration with minimal overhead
- Faster exponential time algorithms for the shortest vector problem
- Finding short lattice vectors within Mordell's inequality
- Fully homomorphic encryption using ideal lattices
- Hardness of approximating the shortest vector problem in lattices
- scientific article; zbMATH DE number 1962809 (Why is no real title available?)
- scientific article; zbMATH DE number 1559544 (Why is no real title available?)
- scientific article; zbMATH DE number 2196508 (Why is no real title available?)
- Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- Inapproximability of the shortest vector problem: toward a deterministic reduction
- Minkowski's Convex Body Theorem and Integer Programming
- On lattices, learning with errors, random linear codes, and cryptography
- On the equidistribution of Hecke points
- Predicting Lattice Reduction
- Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima
- SWIFFT: A Modest Proposal for FFT Hashing
- Trapdoors for hard lattices and new cryptographic constructions
Cited in
(8)- Second order statistical behavior of LLL and BKZ
- The convergence of slide-type reductions
- Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes
- Improving convergence and practicality of slide-type reductions
- Enumeration of lattice points in \(l_1\) norm
- Fast lattice point enumeration with minimal overhead
- On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL
- Rankin’s Constant and Blockwise Lattice Reduction
This page was built for publication: Lattice Point Enumeration on Block Reduced Bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947536)
