Abstract In this paper, we present a heuristic algorithm for solving exact, as well as approximate, shortest vector and closest vector problems on lattices. The algorithm can be seen as a modified sieving algorithm for which the vectors of the intermediate sets lie in overlattices or translated cose...
Research Assistant
AI chat, annotations, notes & similar papers
No comments yet
Be the first to share your thoughts!