Improvements in closest point search based on dual HKZ-bases

DOI10.1016/j.tcs.2013.10.005zbMath1358.11075arXiv1201.5273OpenAlexW2134211661MaRDI QIDQ391764

Gérard Maze, Urs Wagner

Publication date: 13 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1201.5273

zbMATH Keywords

dual latticeclosest vector problemlattice problemsCVPnearest point search

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Lattices and convex bodies (number-theoretic aspects) (11H06)

Related Items (1)

Improvements in the analysis of Kannan's CVP algorithm

Cites Work

• The LLL algorithm. Survey and applications
• On Lovász' lattice reduction and the nearest lattice point problem
• New bounds in some transference theorems in the geometry of numbers
• A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations
• Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
• Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
• Minkowski's Convex Body Theorem and Integer Programming
• Closest point search in lattices
• On the equidistribution of Hecke points
• Unnamed Item
• Unnamed Item

This page was built for publication: Improvements in closest point search based on dual HKZ-bases