On Some Computational Problems in Finite Abelian


We present new algorithms for computing orders of elements, discrete logarithms, and structures of nite abelian groups. We estimate the computational complexity and storage requirements, and we explicitly determine the O-constants and-constants. We implemented the algorithms for class groups of imaginary quadratic orders and present a selection of our… (More)