Meta-heuristic approaches to solve shortest lattice vector problem
From MaRDI portal
Publication:5035010
Recommendations
- Application of mixed integer quadratic program to shortest vector problems
- Optimization of search space for finding very short lattice vectors
- A survey of solving SVP algorithms and recent strategies for solving the SVP challenge
- Modular Form Approach to Solving Lattice Problems
- On the SVP for low-dimensional circulant lattices
Cites work
- scientific article; zbMATH DE number 3909733 (Why is no real title available?)
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 1088241 (Why is no real title available?)
- scientific article; zbMATH DE number 1852142 (Why is no real title available?)
- A genetic algorithm for the set covering problem
- A hierarchy of polynomial time lattice basis reduction algorithms
- A sieve algorithm for the shortest lattice vector problem
- ASYMPTOTIC PROPERTIES OF THE MAXIMUM LIKELIHOOD ESTIMATOR FOR STOCHASTIC PARABOLIC EQUATIONS WITH ADDITIVE FRACTIONAL BROWNIAN MOTION
- Factoring polynomials with rational coefficients
- Integer Programming with a Fixed Number of Variables
- Minkowski's Convex Body Theorem and Integer Programming
- On lattices, learning with errors, random linear codes, and cryptography
- Reconstructing Truncated Integer Variables Satisfying Linear Congruences
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Solving Simultaneous Modular Equations of Low Degree
- The hardness of approximate optima in lattices, codes, and systems of linear equations
This page was built for publication: Meta-heuristic approaches to solve shortest lattice vector problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5035010)