Algorithms for the shortest and closest lattice vector problems
From MaRDI portal
Recommendations
- A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
- Faster exponential time algorithms for the shortest vector problem
- A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
- Sampling methods for shortest vectors, closest vectors and successive minima
- A sieve algorithm for the shortest lattice vector problem
Cites work
- A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
- A hierarchy of polynomial time lattice basis reduction algorithms
- A note on optimal unimodular lattices
- A sieve algorithm for the shortest lattice vector problem
- Accelerating lattice reduction with FPGAs
- Algorithmic Number Theory
- Algorithms to construct Minkowski reduced and Hermite reduced lattice bases
- Approximating shortest lattice vectors is not harder than approximating closest lattice vectors
- Closest point search in lattices
- Covering cubes and the closest vector problem
- Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings
- Factoring polynomials with rational coefficients
- Faster exponential time algorithms for the shortest vector problem
- Finding short lattice vectors within Mordell's inequality
- Finding the closest lattice point by iterative slicing
- Hermite’s Constant and Lattice Algorithms
- scientific article; zbMATH DE number 1676629 (Why is no real title available?)
- scientific article; zbMATH DE number 3859248 (Why is no real title available?)
- scientific article; zbMATH DE number 5485482 (Why is no real title available?)
- scientific article; zbMATH DE number 5764780 (Why is no real title available?)
- scientific article; zbMATH DE number 3987367 (Why is no real title available?)
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 44906 (Why is no real title available?)
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 1088230 (Why is no real title available?)
- scientific article; zbMATH DE number 1559544 (Why is no real title available?)
- scientific article; zbMATH DE number 1859030 (Why is no real title available?)
- scientific article; zbMATH DE number 2120513 (Why is no real title available?)
- scientific article; zbMATH DE number 799775 (Why is no real title available?)
- scientific article; zbMATH DE number 1445397 (Why is no real title available?)
- scientific article; zbMATH DE number 3333393 (Why is no real title available?)
- scientific article; zbMATH DE number 3078637 (Why is no real title available?)
- Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- Inapproximability Results for Computational Problems on Lattices
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Lattice enumeration using extreme pruning
- Lattice-based Cryptography
- Maximum likelihood sequence estimation from the lattice viewpoint
- Minkowski's Convex Body Theorem and Integer Programming
- New bounds in some transference theorems in the geometry of numbers
- On Bounded Distance Decoding for General Lattices
- On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
- On lattices, learning with errors, random linear codes, and cryptography
- On Lovász' lattice reduction and the nearest lattice point problem
- On the Dirichlet-Voronoi cell of unimodular lattices
- On the equidistribution of Hecke points
- On the Extremality of an 80-Dimensional Lattice
- Parallel shortest lattice vector enumeration on graphics cards
- Predicting Lattice Reduction
- Progress on LLL and lattice reduction
- Rankin’s Constant and Blockwise Lattice Reduction
- Rigorous and Efficient Short Lattice Vectors Enumeration
- Sampling methods for shortest vectors, closest vectors and successive minima
- Sieve algorithms for the shortest vector problem are practical
- The complexity of the covering radius problem
- The Magma algebra system. I: The user language
- The worst-case behavior of Schnorr's algorithm approximating the shortest nonzero vector in a lattice
Cited in
(36)- FPT-algorithms for some problems related to integer programming
- Dynamic trading under integer constraints
- List decoding of number field codes
- Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems
- On the complexity of the BKW algorithm on LWE
- Estimation of the hardness of the learning with errors problem with a restricted number of samples
- Efficient computation of multidimensional theta functions
- On the complexity of quasiconvex integer minimization problem
- Balanced integer solutions of linear equations
- Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing
- A Parallel Implementation of GaussSieve for the Shortest Vector Problem in Lattices
- Explicit Hard Instances of the Shortest Vector Problem
- Correcting noisy exponentiation black-boxes modulo a prime
- Closest point search in lattices
- scientific article; zbMATH DE number 1852132 (Why is no real title available?)
- Sieve, Enumerate, Slice, and Lift:
- Application of algebraic-ring in key exchange protocol
- Hermite’s Constant and Lattice Algorithms
- On the density of cyclotomic lattices constructed from codes
- A Note on Lattice Packings via Lattice Refinements
- scientific article; zbMATH DE number 6607548 (Why is no real title available?)
- On the unique shortest lattice vector problem
- Flat Tori with Large Laplacian Eigenvalues in Dimensions up to Eight
- Structured ( ,+)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems
- Attacking (EC)DSA scheme with ephemeral keys sharing specific bits
- On polynomial modular number systems over \(\mathbb{Z}/p\mathbb{Z}\)
- Economical convex coverings and applications
- An ADMM based method for underdetermined box-constrained integer least squares problems
- \textsf{SMAUG}: pushing lattice-based key encapsulation mechanisms to the limits
- Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems
- Attacking (EC)DSA with partially known multiples of nonces
- Extending Regev's quantum algorithm to elliptic curves
- On the practicality of quantum sieving algorithms for the shortest vector problem
- Cross-paradigm models of restricted syndrome decoding with application to CROSS
- Clustering analysis of a dissimilarity: a review of algebraic and geometric representation
- Finding shortest lattice vectors faster using quantum search
This page was built for publication: Algorithms for the shortest and closest lattice vector problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3005588)
