Algebraic number fields and the LLL algorithm

DOI10.1016/j.jsc.2023.102261arXiv1810.01634OpenAlexW2894753027MaRDI QIDQ6051125

Marcell János Uray

Publication date: 19 September 2023

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.01634

zbMATH Keywords

LLL algorithmalgebraic number fieldexact computationrunning time analysisBareiss algorithm

Mathematics Subject Classification ID

Algebraic number theory computations (11Y40) Algebraic numbers; rings of algebraic integers (11R04)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On multidimensional Diophantine approximation of algebraic numbers
• Topics in computational algebraic number theory
• Factoring polynomials with rational coefficients
• On the computation of the HNF of a module over the ring of integers of a number field
• An LLL algorithm for module lattices
• An introduction to the geometry of numbers.
• H-LLL
• LLL reducing with the most significant bits
• An LLL Algorithm with Quadratic Complexity
• Short Bases of Lattices over Number Fields
• Adaptive Precision Floating Point LLL
• Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination

This page was built for publication: Algebraic number fields and the LLL algorithm