Meta-heuristic approaches to solve shortest lattice vector problem

DOI10.1080/09720529.2019.1675300OpenAlexW2983126839MaRDI QIDQ5035010

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

zbMATH Keywords

GAshortest vector problemlattice problemsPSO

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Uses Software

• NTRU

Cites Work

• A hierarchy of polynomial time lattice basis reduction algorithms
• Factoring polynomials with rational coefficients
• A genetic algorithm for the set covering problem
• The hardness of approximate optima in lattices, codes, and systems of linear equations
• 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
• Solving Simultaneous Modular Equations of Low Degree
• Reconstructing Truncated Integer Variables Satisfying Linear Congruences
• 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
• On lattices, learning with errors, random linear codes, and cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Meta-heuristic approaches to solve shortest lattice vector problem