|Title:||AN ALGORITHM FOR FINDING A SHORTEST VECTOR IN A TWO DIMENSIONAL MODULAR LATTICE
|Authors:||Mody Lempel and Azaria Paz
|Abstract:||Let 0 < a,b < d be integers with a ¢ b. The lattice Ld(a,b) is the set of all multiples of the vector (a,b) modulo d. An algorithm is presented for finding a shortest vector in Ld(a,b). The complexity of the algorithm is shown to be logarithmic in the size of d, when the number of arithmetical operations are counted.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1990/CS/CS0658), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1990
To the main CS technical reports page
Computer science department, Technion