A generalization of the LLL-algorithm over Euclidean rings or orders
From MaRDI portal
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.
Recommendations
- A generalization of LLL lattice basis reduction over imaginary quadratic fields
- On LLL lattice basis reduction over imaginary quadratic fields by introducing reduction parameters
- Lattice reductions over Euclidean rings with applications to cryptanalysis
- A modification of the LLL reduction algorithm
- scientific article; zbMATH DE number 1113832
Cites work
- A modification of the LLL reduction algorithm
- Applications of coding theory to the construction of modular lattices
- Factoring polynomials with rational coefficients
- scientific article; zbMATH DE number 435565 (Why is no real title available?)
- scientific article; zbMATH DE number 3613145 (Why is no real title available?)
- scientific article; zbMATH DE number 979850 (Why is no real title available?)
- scientific article; zbMATH DE number 1113832 (Why is no real title available?)
- scientific article; zbMATH DE number 3092634 (Why is no real title available?)
- Neighborhood in the sense of Kneser for quaternionic lattices
- Structures algébriques sur les réseaux
- The Euclidean algorithm in algebraic number fields
Cited in
(15)- Lattice reductions over Euclidean rings with applications to cryptanalysis
- Volumes and distributions for random unimodular complex and quaternion lattices
- Fast reduction of algebraic lattices over cyclotomic fields
- Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP
- Worst-case to average-case reductions for module lattices
- Extending Djoković's lattice reduction algorithm to include isotropic lattices
- Short bases of lattices over number fields
- A generalization of LLL lattice basis reduction over imaginary quadratic fields
- Short Stickelberger class relations and application to Ideal-SVP
- On the reduction of a random basis
- The special case of cyclotomic fields in quantum algorithms for unit groups
- Subfield algorithms for ideal- and module-SVP based on the decomposition group
- Rational approximations, multidimensional continued fractions, and lattice reduction
- Divisors in residue classes revisited
- An application of lattice basis reduction to polynomial identities for algebraic structures
This page was built for publication: A generalization of the LLL-algorithm over Euclidean rings or orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q679101)
