A generalization of the LLL-algorithm over Euclidean rings or orders

DOI10.5802/JTNB.176MaRDI QIDQ679101zbMATH OpenOpenAlexFDO

Authors Huguette Napias

Publication date 26 November 1997

Published in Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)

Full work available at URL http://www.numdam.org/item?id=JTNB_1996__8_2_387_0, https://eudml.org/doc/93665, http://www.emis.de/journals/JTNB/1996-2/jtnb8-2.html

zbMATH Keywords

Euclidean ringslattice basis reductionlattices over ordersLLL-algorithmmaximal orders of imaginary quadratic fieldsorders of a quaternion algebra

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40)

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

(14)

• 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
• An application of lattice basis reduction to polynomial identities for algebraic structures

Describes a project that uses

Uses Software

• PARI/GP

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)