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

DOI10.5802/JTNB.176zbMATH Open0876.11058OpenAlexW2071788187MaRDI QIDQ679101FDOQ679101

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

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

zbMATH Keywords

LLL-algorithmlattice basis reductionEuclidean ringslattices over ordersmaximal orders of imaginary quadratic fieldsorders of a quaternion algebra

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Factoring polynomials with rational coefficients
• Applications of coding theory to the construction of modular lattices
• Title not available (Why is that?)
• The Euclidean algorithm in algebraic number fields
• Title not available (Why is that?)
• Title not available (Why is that?)
• A modification of the LLL reduction algorithm
• Neighborhood in the sense of Kneser for quaternionic lattices
• Title not available (Why is that?)
• Structures algébriques sur les réseaux

Cited In (12)

• Volumes and distributions for random unimodular complex and quaternion lattices
• An application of lattice basis reduction to polynomial identities for algebraic structures
• Short Stickelberger Class Relations and Application to Ideal-SVP
• On the reduction of a random basis
• Rational approximations, multidimensional continued fractions, and lattice reduction
• The special case of cyclotomic fields in quantum algorithms for unit groups
• Short Bases of Lattices over Number Fields
• Subfield algorithms for ideal- and module-SVP based on the decomposition group
• Extending Djoković's lattice reduction algorithm to include isotropic lattices
• Worst-case to average-case reductions for module lattices
• Fast reduction of algebraic lattices over cyclotomic fields
• Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP

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)