Lecture Notes in Computer Science, 2001, Volume 2146/2001, 1-3, DOI: 10.1007/3-540-44670-2_1

An Overview of the Sieve Algorithm for the Shortest Lattice Vector Problem

Miklós Ajtai, Ravi Kumar and Dandapani Sivakumar

View Related Documents

Abstract

We present an overview of a randomized 2g(n) time algorithm to compute a shortest non-zero vector in an n-dimensional rational lattice. The complete details of this algorithm can be found in [2].

Fulltext Preview

Image of the first page of the fulltext document