Structure computation and discrete logarithms in finite abelian $p$-groups
type: Item
instance of: scholarly article
title: Structure computation and discrete logarithms in finite abelian $p$-groups
zbMATH Open document ID: 1225.11163
DOI: 10.1090/S0025-5718-10-02356-2
author: Andrew V. Sutherland
published in: Mathematics of Computation
publication date: 2011-03-07T00:00:00Z
full work available at URL: https://arxiv.org/abs/0809.3413
Mathematics Subject Classification ID: 11Y16
Mathematics Subject Classification ID: 20K01
Mathematics Subject Classification ID: 12Y05
zbMATH DE Number: 5862042
zbMATH Keywords: finite abelian \(p\)-group
zbMATH Keywords: structure computation
zbMATH Keywords: discrete logarithm
MaRDI profile type: Publication
Wikidata QID: Q29042132
arXiv ID: 0809.3413
cites work: Q4887957
cites work: Q4240509
cites work: Q4279677
cites work: On some computational problems in finite abelian groups
cites work: Computing the structure of a finite abelian group
cites work: Binary quadratic forms. An algorithmic approach
cites work: Q4335291
cites work: Q3139838
cites work: A Survey of Fast Exponentiation Methods
cites work: Q4940686
cites work: Q4718481
cites work: Discrete logarithms: The past and the future
cites work: An improved algorithm for computing logarithms over&lt;tex&gt;GF(p)&lt;/tex&gt;and its cryptographic significance (Corresp.)
cites work: The expected number of random elements to generate a finite Abelian group
cites work: Q5316395
cites work: A space efficient algorithm for group structure computation
cites work: Q3840196
cites work: The Pohlig-Hellman method generalized for group structure computation
description: scientific article