de.mpg.escidoc.pubman.appbase.FacesBean
English

# Item

ITEM ACTIONSEXPORT

Released

Report

#### Short vectors of planar lattices via continued fractions

##### MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44373

Eisenbrand,  Friedrich
Programming Logics, MPI for Informatics, Max Planck Society;

##### Locator
There are no locators available
##### Fulltext (public)

eisen.ps
(Any fulltext), 118KB

##### Supplementary Material (public)
There is no public supplementary material available
##### Citation

Eisenbrand, F.(2000). Short vectors of planar lattices via continued fractions (MPI-I-2000-2-001). Saarbrücken: Max-Planck-Institut für Informatik.

Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-6567-4
##### Abstract
We describe how a shortest vector of a 2-dimensional integral lattice corresponds to a best approximation of a unique rational number defined by the lattice. This rational number and its best approximations can be computed with the euclidean algorithm and its speedup by Schoenhage (1971) from any basis of the lattice. The described correspondence allows, on the one hand, to reduce a basis of a 2-dimensional integral lattice with the euclidean algorithm, up to a single normalization step. On the other hand, one can use the classical result of Schoenhage (1971) to obtain a shortest vector of a 2-dimensional integral lattice with respect to the $\ell_\infty$-norm. It follows that in two dimensions, a fast basis-reduction algorithm can be solely based on Schönhage's algorithm and the reduction algorithm of Gauss (1801).