The Pohlig-Hellman method generalized for group structure computation

DOI10.1006/jsco.1999.0279zbMath0949.20038OpenAlexW1981795227MaRDI QIDQ1300626

Edlyn Teske

Publication date: 3 December 2000

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.1999.0279

zbMATH Keywords

algorithmsfinite Abelian groups

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Finite abelian groups (20K01) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items (9)

EFFICIENT ALGORITHMS FOR THE BASIS OF FINITE ABELIAN GROUPS ⋮ Cryptographic multilinear maps using pro-\(p\) groups ⋮ An Algorithm for Computing a Basis of a Finite Abelian Group ⋮ A public key encryption scheme based on factoring and discrete logarithm ⋮ A generic approach to searching for Jacobians ⋮ Orienting supersingular isogeny graphs ⋮ Structure computation and discrete logarithms in finite abelian $p$-groups ⋮ Isogeny-based key compression without pairings ⋮ Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies

Cites Work

• A Rigorous Subexponential Algorithm For Computation of Class Groups
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• A space efficient algorithm for group structure computation
• On some computational problems in finite abelian groups

This page was built for publication: The Pohlig-Hellman method generalized for group structure computation