Structure computation and discrete logarithms in finite abelian $p$-groups

DOI10.1090/S0025-5718-10-02356-2zbMath1225.11163arXiv0809.3413WikidataQ29042132 ScholiaQ29042132MaRDI QIDQ3081295

Andrew V. Sutherland

Publication date: 7 March 2011

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

Full work available at URL: https://arxiv.org/abs/0809.3413

zbMATH Keywords

discrete logarithmfinite abelian \(p\)-groupstructure computation

Mathematics Subject Classification ID

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

Related Items (23)

From the Birch and Swinnerton-Dyer conjecture to Nagao’s conjecture ⋮ Sato–Tate distributions and Galois endomorphism modules in genus 2 ⋮ On the Cipolla-Lehmer type algorithms in finite fields ⋮ On the Security of OSIDH ⋮ Construction of all cubic function fields of a given square-free discriminant ⋮ Breaking SIDH in polynomial time ⋮ Cryptographic multilinear maps using pro-\(p\) groups ⋮ Fast Jacobian arithmetic for hyperelliptic curves of genus 3 ⋮ Hashing to elliptic curves through Cipolla-Lehmer-Müller's square root algorithm ⋮ Sato-Tate distributions ⋮ On taking square roots without quadratic nonresidues over finite fields ⋮ Public-key cryptosystem based on invariants of diagonalizable groups ⋮ Accelerating the CM method ⋮ Identifying supersingular elliptic curves ⋮ Efficient Compression of SIDH Public Keys ⋮ Algorithmic problems in Engel groups and cryptographic applications ⋮ Unconditional computation of the class groups of real quadratic fields ⋮ Unconditional class group tabulation of imaginary quadratic fields to $\|\Delta \| < 2^{40}$ ⋮ Isogeny-based key compression without pairings ⋮ A probabilistic analysis on a lattice attack against DSA ⋮ New cube root algorithm based on the third order linear recurrence relations in finite fields ⋮ Computing 𝐿-polynomials of Picard curves from Cartier–Manin matrices ⋮ Computing Hasse–Witt matrices of hyperelliptic curves in average polynomial time

Cites Work

• Binary quadratic forms. An algorithmic approach
• The Pohlig-Hellman method generalized for group structure computation
• Discrete logarithms: The past and the future
• An improved algorithm for computing logarithms over&lt;tex&gt;GF(p)&lt;/tex&gt;and its cryptographic significance (Corresp.)
• A Survey of Fast Exponentiation Methods
• A space efficient algorithm for group structure computation
• On some computational problems in finite abelian groups
• Computing the structure of a finite abelian group
• The expected number of random elements to generate a finite Abelian group
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Structure computation and discrete logarithms in finite abelian $p$-groups