Annealing-based algorithm for solving CVP and SVP

MaRDI QIDQ5052999zbMATH OpenFDO

Authors Junpei Yamaguchi, Toshiya Shimizu, Kazuyoshi Furukawa, Ryuichi Ohori, Takeshi Shimoyama, Avradip Mandal, Hart Montgomery, Arnab Roy, Takuya Ohwa

Publication date 25 November 2022

zbMATH Keywords

annealing computerIsing modellattice enumerationoptimizationshortest vector problem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Solving some cryptanalytic problems for lattice-based cryptosystems with quantum annealing method
• A survey of solving SVP algorithms and recent strategies for solving the SVP challenge
• Application of mixed integer quadratic program to shortest vector problems
• Sieving for closest lattice vectors (with preprocessing)
• Quantum algorithms for the approximate \(k\)-list problem and their application to lattice sieving

Cited in

(5)

• Annealing algorithms for multisource absolute location problems on graph
• Local search with annealing-like restarts to solve the VRPTW
• Application of mixed integer quadratic program to shortest vector problems
• A survey of solving SVP algorithms and recent strategies for solving the SVP challenge
• Solving some cryptanalytic problems for lattice-based cryptosystems with quantum annealing method

This page was built for publication: Annealing-based algorithm for solving CVP and SVP

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5052999)