Meta-heuristic approaches to solve shortest lattice vector problem
DOI10.1080/09720529.2019.1675300OpenAlexW2983126839MaRDI QIDQ5035010FDOQ5035010
G. S. V. R. K. Rao, V. Dinesh Reddy
Publication date: 21 February 2022
Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720529.2019.1675300
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A hierarchy of polynomial time lattice basis reduction algorithms
- A sieve algorithm for the shortest lattice vector problem
- Factoring polynomials with rational coefficients
- A genetic algorithm for the set covering problem
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- 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
- The hardness of approximate optima in lattices, codes, and systems of linear equations
- ASYMPTOTIC PROPERTIES OF THE MAXIMUM LIKELIHOOD ESTIMATOR FOR STOCHASTIC PARABOLIC EQUATIONS WITH ADDITIVE FRACTIONAL BROWNIAN MOTION
- Reconstructing Truncated Integer Variables Satisfying Linear Congruences
- Solving Simultaneous Modular Equations of Low Degree
Uses Software
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)
