Certified lattice reduction (Q2008874)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7136845
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Certified lattice reduction |
scientific article; zbMATH DE number 7136845 |
Statements
Certified lattice reduction (English)
0 references
26 November 2019
0 references
A lattice is a free \(\mathbb{Z}\) module, equipped with a positive definite bilinear form on its ambient space. The authors give an adaptive-precision version of a generalized Lenstra-Lenstra-Lovász reduction algorithm for real lattices. Specifically, the floating-point arithmetic is replaced by interval arithmetic to certify the behavior of the algorithm. Additionally, they give an application of the result for the reduction of ideal lattices in number fields.
0 references
lattice reduction
0 references
quadratic forms reduction
0 references
algorithmic number theory
0 references
0.8395326137542725
0 references
0.8268753290176392
0 references
0.8150883913040161
0 references
0.8133383989334106
0 references
