Computing a lattice basis from a system of generating vectors

DOI10.1007/3-540-51517-8_89MaRDI QIDQ5393303zbMATH OpenOpenAlexFDO

Authors Johannes Buchmann, Michael E. Pohst

Publication date 16 April 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-51517-8_89

Mathematics Subject Classification ID

Lattices and convex bodies (number-theoretic aspects) (11H06) Number-theoretic algorithms; complexity (11Y16) Symbolic computation and algebraic computation (68W30)

Recommendations

• Computing a lattice basis revisited
• scientific article; zbMATH DE number 5149740
• Computing Gröbner bases associated with lattices
• scientific article; zbMATH DE number 3972987
• scientific article; zbMATH DE number 554490
• scientific article; zbMATH DE number 6168348
• Computing an LLL-reduced basis of the orthogonal latice
• Counting lattice vectors
• Computing Gröbner Bases within Linear Algebra
• Calculation of Minkowski-reduced lattice bases

Cited in

(11)

• A modification of the LLL reduction algorithm
• Practical algorithms for polycyclic matrix groups
• On the quantum complexity of the continuous hidden subgroup problem
• scientific article; zbMATH DE number 3880577 (Why is no real title available?)
• scientific article; zbMATH DE number 5149740 (Why is no real title available?)
• Short bases of lattices over number fields
• Computing a lattice basis revisited
• A numerical transcendental method in algebraic geometry: computation of Picard groups and related invariants
• The special case of cyclotomic fields in quantum algorithms for unit groups
• Generating basis sets of double differences
• Unconditional foundations for supersingular isogeny-based cryptography

This page was built for publication: Computing a lattice basis from a system of generating vectors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5393303)