Search Graph Formulation and Hasting’s Generalization of Metropolis Algorithm For Solving SVP

Shenoy, Ajitha K B and Biswas, Somenath and Kurur, Piyush P (2013) Search Graph Formulation and Hasting’s Generalization of Metropolis Algorithm For Solving SVP. International Journal of Computer Information Systems and Industrial Management Applications, 5. pp. 317-325. ISSN 2150-7988

[img] PDF
Paper108.pdf - Published Version
Restricted to Registered users only

Download (317kB) | Request a copy

Abstract

Shortest Lattice Vector Problem (SVP) has numerous applications spanning from robotics to computational number theory, viz., polynomial factorization. At the same time, SVP is a notoriously hard problem. Not only it is NP-hard, there is not even any polynomial approximation known for the problem that runs in polynomial time. What one normally uses is the LLL algorithm which, although a polynomial time algorithm, may give solutions which are an exponential factor away from the optimum. In this paper, we have defined an appropriate search space for the problem which we use for implementation of the Hasting’s generalization of the Metropolis algorithm. We have defined a suitable neighbourhood structure which makes the diameter of the space polynomially bounded, and we ensure that each search point has only polynomially many neighbours. We also proved that our search space graphs for SVP has magnification greater than half. We have implemented the Metropolis algorithm and Hasting’s generalization of the Metropolis algorithm for the SVP. Our results are quite encouraging in all instances when compared with LLL algorithm.

Item Type: Article
Uncontrolled Keywords: SVP, Search Space, Metropolis Algorithm, Hasting’s Generalization, LLL
Subjects: Engineering > MIT Manipal > Information and Communication Technology
Depositing User: MIT Library
Date Deposited: 20 Feb 2015 10:55
Last Modified: 20 Feb 2015 10:55
URI: http://eprints.manipal.edu/id/eprint/141727

Actions (login required)

View Item View Item