A generalization of the LLL-algorithm over Euclidean rings or orders (Q679101): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q331136 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Michael E. Pohst / rank | |||
Normal rank | |||
Revision as of 06:18, 13 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A generalization of the LLL-algorithm over Euclidean rings or orders |
scientific article |
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
