An overview of the sieve algorithm for the shortest lattice vector problem

4Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Ajtai, M., Kumar, R., & Sivakumar, D. (2001). An overview of the sieve algorithm for the shortest lattice vector problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2146, pp. 1–3). Springer Verlag. https://doi.org/10.1007/3-540-44670-2_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free