On some computational problems in finite abelian groups
From MaRDI portal
Publication:4372641
DOI10.1090/S0025-5718-97-00880-6zbMath0894.11050OpenAlexW2086866537MaRDI QIDQ4372641
Johannes A. Buchmann, Edlyn Teske, Michael J. Jacobson jun.
Publication date: 16 December 1997
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-97-00880-6
algorithmdiscrete logarithm problemfinite abelian groupsbaby-step giant-stepcomplexity resultscomputational group theoryclass groups of imaginary quadratic ordersorder computation problemsstructure problem
Related Items
Determining the small solutions to 𝑆-unit equations ⋮ A Terr algorithm for computations in the infrastructure of real-quadratic number fields ⋮ Computing the structure of a finite abelian group ⋮ Computing the binomial part of a polynomial ideal ⋮ Public-key cryptosystem based on invariants of diagonalizable groups ⋮ Linear and sublinear time algorithms for the basis of abelian groups ⋮ Construction of hyperelliptic function fields of high three-rank ⋮ A modification of Shanks' baby-step giant-step algorithm ⋮ A generic approach to searching for Jacobians ⋮ Unconditional class group tabulation of imaginary quadratic fields to $\|\Delta \| < 2^{40}$ ⋮ Discrete logarithm in an arbitrary quotient ring of polynomials of one variable over a finite field ⋮ Structure computation and discrete logarithms in finite abelian $p$-groups ⋮ Quadratic class numbers and character sums ⋮ COMPUTING NORMAL INTEGRAL BASES OF ABELIAN NUMBER FIELDS ⋮ A space efficient algorithm for group structure computation ⋮ The Pohlig-Hellman method generalized for group structure computation
Uses Software
