Algorithms to construct Minkowski reduced and Hermite reduced lattice bases
Theoretical Computer Science
Minkowski's convex body theorem and integer programming
Mathematics of Operations Research
A hierarchy of polynomial time lattice basis reduction algorithms
Theoretical Computer Science
Lattice basis reduction: improved practical algorithms and solving subset sum problems
Mathematical Programming: Series A and B
Generating hard instances of lattice problems (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A public-key cryptosystem with worst-case/average-case equivalence
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The MAGMA algebra system I: the user language
Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
Approximating shortest lattice vectors is not harder than approximating closet lattice vectors
Information Processing Letters
Finding the closest lattice vector when it's unusually close
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A sieve algorithm for the shortest lattice vector problem
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Complexity of Lattice Problems
Complexity of Lattice Problems
A procedure for determining algebraic integers of given norm
EUROCAL '83 Proceedings of the European Computer Algebra Conference on Computer Algebra
Public-Key Cryptosystems from Lattice Reduction Problems
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Reducing lattice bases by means of approximations
ANTS-I Proceedings of the First International Symposium on Algorithmic Number Theory
NTRU: A Ring-Based Public Key Cryptosystem
ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Improved algorithms for integer programming and related lattice problems
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Sampling Short Lattice Vectors and the Closest Lattice Vector Problem
CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
On lattices, learning with errors, random linear codes, and cryptography
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Tensor-based hardness of the shortest vector problem to within almost polynomial factors
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Efficient reductions among lattice problems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Finding short lattice vectors within mordell's inequality
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
The complexity of the covering radius problem
Computational Complexity
Rigorous and Efficient Short Lattice Vectors Enumeration
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Sampling methods for shortest vectors, closest vectors and successive minima
Theoretical Computer Science
On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
Finding the Closest Lattice Point by Iterative Slicing
SIAM Journal on Discrete Mathematics
The LLL Algorithm: Survey and Applications
The LLL Algorithm: Survey and Applications
Attacking the Chor-Rivest cryptosystem by improved lattice reduction
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Improved analysis of Kannan's shortest lattice vector algorithm
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Proceedings of the forty-second ACM symposium on Theory of computing
The Learning with Errors Problem (Invited Survey)
CCC '10 Proceedings of the 2010 IEEE 25th Annual Conference on Computational Complexity
Faster exponential time algorithms for the shortest vector problem
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Accelerating lattice reduction with FPGAs
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
Covering cubes and the closest vector problem
Proceedings of the twenty-seventh annual symposium on Computational geometry
ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory
Lattice enumeration using extreme pruning
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
On bounded distance decoding for general lattices
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Rankin's constant and blockwise lattice reduction
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Parallel shortest lattice vector enumeration on graphics cards
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
Integer parameter estimation in linear models with applications toGPS
IEEE Transactions on Signal Processing
Closest point search in lattices
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
We present the state of the art solvers of the Shortest and Closest Lattice Vector Problems in the Euclidean norm. We recall the three main families of algorithms for these problems, namely the algorithm by Micciancio and Voulgaris based on the Voronoi cell [STOC'10], the Monte-Carlo algorithms derived from the Ajtai, Kumar and Sivakumar algorithm [STOC'01] and the enumeration algorithms originally elaborated by Kannan [STOC'83] and Fincke and Pohst [EUROCAL'83]. We concentrate on the theoretical worst-case complexity bounds, but also consider some practical facets of these algorithms.