An algorithm for computing a basis of a finite abelian group

Authors:
Gregory Karagiorgos;Dimitrios Poulakis
Affiliations:
Department of Technology of Informatics and Telecommunications, T.E.I of Kalamata, Sparta, Greece;Aristotle University of Thessaloniki, Department of Mathematics, Thessaloniki, Greece
Venue:
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Year:
2011

Citing 11
Cited 1

Worst-case complexity bounds on algorithms for computing the canonical structure of finite Abelian groups and the Hermite and Smith normal forms of an integer matrix

SIAM Journal on Computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Journal on Computing
A space efficient algorithm for group structure computation

Mathematics of Computation
Modern computer algebra

Modern computer algebra
The Pohlig-Hellman method generalized for group structure computation

Journal of Symbolic Computation
On Exponential Sums and Group Generators for Elliptic Curves over Finite Fields

ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
A Survey of Public-Key Cryptosystems

SIAM Review
Decodability of group homomorphisms beyond the johnson bound

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Linear and sublinear time algorithms for the basis of abelian groups

Theoretical Computer Science
Decomposing finite Abelian groups

Quantum Information & Computation
On the use of gröbner bases for computing the structure of finite abelian groups

CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing

Linear time algorithms for the basis of abelian groups

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider the problem of computation of a basis for a finite abelian group G with N elements. We present a deterministic algorithm such that given a generating set for G and the prime factorization of N, it computes a basis of G.