JSIAM Letters
Online ISSN : 1883-0617
Print ISSN : 1883-0609
ISSN-L : 1883-0617
Articles
Application of mixed integer quadratic program to shortest vector problems
Keiji KimuraHayato WakiMasaya Yasuda
Author information
JOURNALS FREE ACCESS

2017 Volume 9 Pages 65-68

Details
Abstract

The security of lattice-based cryptography is mainly based on the fact that the shortest vector problem (SVP) is NP-hard. Our interest is to know how large-scale shortest vector problems can be solved by the state-of-the-art software for mixed-integer programs. For this, we provide a formulation for SVP via mixed integer quadratic program and show the numerical performance for TU Darmstadt's benchmark instances with the dimension up to 49.

Information related to the author
© 2017, The Japan Society for Industrial and Applied Mathematics
Previous article Next article
feedback
Top