Lattice basis reduction for indefinite forms and an application

DOI10.1016/0012-365X(95)00135-JzbMath0848.68041OpenAlexW2038855167MaRDI QIDQ1917523

Gábor Ivanyos, Agnes Szanto

Publication date: 8 October 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00135-j

zbMATH Keywords

lattice basis reduction algorithm

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (9)

Explicit equivalence of quadratic forms over \(\mathbb{F}_q(t)\) ⋮ Splitting quaternion algebras over quadratic number fields ⋮ Splitting full matrix algebras over algebraic number fields. ⋮ Trivializing a central simple algebra of degree 4 over the rational numbers. ⋮ Identifying the Matrix Ring: Algorithms for Quaternion Algebras and Quadratic Forms ⋮ Selected Applications of LLL in Number Theory ⋮ A Lie algebra method for rational parametrization of Severi-Brauer surfaces. ⋮ Identification and signatures based on NP-hard problems of indefinite quadratic forms ⋮ Cryptography Based on Quadratic Forms: Complexity Considerations

Cites Work

• A modification of the LLL reduction algorithm
• Finding maximal orders in semisimple algebras over \(\mathbb{Q}\)
• Algorithmic properties of maximal orders in simple algebras over \(\mathbb{Q}\)
• Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
• Zero divisors in quaternion algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Lattice basis reduction for indefinite forms and an application