Closest point search in lattices

DOI10.1109/TIT.2002.800499zbMath1062.94035OpenAlexW2140940105WikidataQ57567982 ScholiaQ57567982MaRDI QIDQ4677541

Alexander Vardy, Kenneth Zeger, Erik Agrell, Thomas Eriksson

Publication date: 11 May 2005

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2002.800499

Mathematics Subject Classification ID

Cryptography (94A60) Minima of forms (11H50)

Related Items (33)

Voronoi Cells of Lattices with Respect to Arbitrary Norms ⋮ Euclidean distances and least squares problems for a given set of vectors ⋮ Efficient algorithms for discrete lattice calculations ⋮ Compressed sensing for finite-valued signals ⋮ PROMP: a sparse recovery approach to lattice-valued signals ⋮ A non-commutative cryptosystem based on quaternion algebras ⋮ Sharper bounds on four lattice constants ⋮ Improvements in closest point search based on dual HKZ-bases ⋮ The Optimal Lattice Quantizer in Nine Dimensions ⋮ Loop-reduction LLL algorithm and architecture for lattice-reduction-aided MIMO detection ⋮ A sharper lower bound on Rankin's constant ⋮ Sieving for closest lattice vectors (with preprocessing) ⋮ A pivoted LLL algorithm ⋮ MLAMBDA: a modified LAMBDA method for integer least-squares estimation ⋮ The irreducible vectors of a lattice: some theory and applications ⋮ Sieve algorithms for the shortest vector problem are practical ⋮ Algorithms for the Shortest and Closest Lattice Vector Problems ⋮ Integer matrix approximation and data mining ⋮ A semidefinite programming method for integer convex quadratic minimization ⋮ Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems ⋮ Random Sampling Revisited: Lattice Enumeration with Discrete Pruning ⋮ Selected Applications of LLL in Number Theory ⋮ Low-complexity receivers for multiuser detection with an unknown number of active users ⋮ Rigorous and Efficient Short Lattice Vectors Enumeration ⋮ A Digital Signature Scheme Based on CVP  ∞ ⋮ Dynamic trading under integer constraints ⋮ Parallel Cholesky-based reduction for the weighted integer least squares problem ⋮ Proximal Distance Algorithms: Theory and Examples ⋮ Dense periodic packings of tetrahedra with small repeating units ⋮ The Diagonal Reduction Algorithm Using Fast Givens ⋮ The shortest vector problem and tame kernels of cyclotomic fields ⋮ A low complexity branch-and-bound-based decoder for V-BLAST systems with PSK signals ⋮ A Numerical Method for Solving Quadratic Integer Programming Problem

This page was built for publication: Closest point search in lattices