Improvements in the analysis of Kannan's CVP algorithm
From MaRDI portal
Publication:5964026
DOI10.1016/j.tcs.2016.01.038zbMath1335.68301OpenAlexW2257657701MaRDI QIDQ5964026
Publication date: 26 February 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.01.038
Symbolic computation and algebraic computation (68W30) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improvements in closest point search based on dual HKZ-bases
- Sampling methods for shortest vectors, closest vectors and successive minima
- On Lovász' lattice reduction and the nearest lattice point problem
- Algorithms to construct Minkowski reduced and Hermite reduced lattice bases
- A hierarchy of polynomial time lattice basis reduction algorithms
- Factoring polynomials with rational coefficients
- New bounds in some transference theorems in the geometry of numbers
- Approximating CVP to within almost-polynomial factors is NP-hard
- A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations
- Collision-Free Hashing from Lattice Problems
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- Trapdoors for hard lattices and new cryptographic constructions
- Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
- Lattice-based Cryptography
- A sieve algorithm for the shortest lattice vector problem
- Inapproximability Results for Computational Problems on Lattices
- Adapting Density Attacks to Low-Weight Knapsacks
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Improvements in the analysis of Kannan's CVP algorithm
