Rigorous Computation of Fundamental Units in Algebraic Number Fields

Abstract

We present an algorithm that unconditionally computes a representation of the unit group of a number field of discriminant ∆ K , given a full-rank subgroup as input, in asymptotically fewer bit operations than the baby-step giant-step algorithm. If the input is assumed to represent the full unit group, for example, under the assumption of the Generalized Riemann Hypothesis, then our algorithm can unconditionally certify its correctness in expected time O(∆) where n is the unit rank.