Lattice Point Enumeration on Block Reduced Bases
From MaRDI portal
Publication:2947536
DOI10.1007/978-3-319-17470-9_16zbMath1359.94630OpenAlexW811113453MaRDI QIDQ2947536
Publication date: 24 September 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-17470-9_16
Related Items (5)
Improving convergence and practicality of slide-type reductions ⋮ Second order statistical behavior of LLL and BKZ ⋮ On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL ⋮ Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes ⋮ The convergence of slide-type reductions
Cites Work
- A hierarchy of polynomial time lattice basis reduction algorithms
- Factoring polynomials with rational coefficients
- A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- BKZ 2.0: Better Lattice Security Estimates
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- SWIFFT: A Modest Proposal for FFT Hashing
- Hardness of approximating the shortest vector problem in lattices
- Trapdoors for hard lattices and new cryptographic constructions
- Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
- Minkowski's Convex Body Theorem and Integer Programming
- On the equidistribution of Hecke points
- Candidate Multilinear Maps from Ideal Lattices
- Fully homomorphic encryption using ideal lattices
- A sieve algorithm for the shortest lattice vector problem
- Fast Lattice Point Enumeration with Minimal Overhead
- Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima
- Asymptotically Efficient Lattice-Based Digital Signatures
- Predicting Lattice Reduction
- On lattices, learning with errors, random linear codes, and cryptography
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Lattice Point Enumeration on Block Reduced Bases