A generalization of the LLL-algorithm over Euclidean rings or orders (Q679101)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A generalization of the LLL-algorithm over Euclidean rings or orders |
scientific article; zbMATH DE number 1002067
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A generalization of the LLL-algorithm over Euclidean rings or orders |
scientific article; zbMATH DE number 1002067 |
Statements
A generalization of the LLL-algorithm over Euclidean rings or orders (English)
0 references
26 November 1997
0 references
The author uses the Euclidean structure with respect to the norm of several orders to generalize the LLL-algorithm for lattice basis reduction to lattices over these orders. In particular lattices are considered over the maximal orders of \(\mathbb{Q} (\sqrt m)\), \(m\in \{-1, -2,-3, -7,-11\}\), and two orders of a quaternion algebra. The article is a short version of the author's thesis, no proofs are included.
0 references
lattices over orders
0 references
Euclidean rings
0 references
maximal orders of imaginary quadratic fields
0 references
orders of a quaternion algebra
0 references
LLL-algorithm
0 references
lattice basis reduction
0 references
0.835693895816803
0 references
0.8140215873718262
0 references
0.7826724648475647
0 references
0.7766631841659546
0 references
