On some computational problems in finite abelian groups

DOI10.1090/S0025-5718-97-00880-6MaRDI QIDQ4372641zbMATH OpenOpenAlexFDO

Authors Johannes Buchmann, Michael J. Jacobson jun., Edlyn Teske

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

zbMATH Keywords

algorithmbaby-step giant-stepclass groups of imaginary quadratic orderscomplexity resultscomputational group theorydiscrete logarithm problemfinite abelian groupsorder computation problemsstructure problem

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Finite abelian groups (20K01)

Recommendations

• scientific article; zbMATH DE number 1257081
• A space efficient algorithm for group structure computation
• Computing the structure of a finite abelian group
• Structure computation and discrete logarithms in finite abelian \(p\)-groups

Cited in

(29)

• Computing in general Abelian groups is hard
• The Pohlig-Hellman method generalized for group structure computation
• Computing discrete logarithms in quadratic orders
• Roots of unity in orders
• A Terr algorithm for computations in the infrastructure of real-quadratic number fields
• Computable abelian groups
• Unconditional class group tabulation of imaginary quadratic fields to \(| \Delta| < 2^{40}\)
• Efficient algorithms for the basis of finite abelian groups
• A generic approach to searching for Jacobians
• 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
• scientific article; zbMATH DE number 6004943 (Why is no real title available?)
• scientific article; zbMATH DE number 3871319 (Why is no real title available?)
• A space efficient algorithm for group structure computation
• scientific article; zbMATH DE number 1257081 (Why is no real title available?)
• Determining the small solutions to 𝑆-unit equations
• A modification of Shanks' baby-step giant-step algorithm
• Computing normal integral bases of abelian number fields
• Public-key cryptosystem based on invariants of diagonalizable groups
• Computing the structure of a finite abelian group
• Construction of hyperelliptic function fields of high three-rank
• Quadratic class numbers and character sums
• Linear and sublinear time algorithms for the basis of abelian groups
• Picard Groups and Refined Discrete Logarithms
• Computing the binomial part of a polynomial ideal
• Classifying problems on linear congruences and Abelian permutation groups using logspace counting classes
• Unconditional computation of the class groups of real quadratic fields
• A low-memory algorithm for finding short product representations in finite groups.
• Root extraction in finite abelian groups

Describes a project that uses

Uses Software

• LiDIA

This page was built for publication: On some computational problems in finite abelian groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4372641)