Structure computation and discrete logarithms in finite abelian p-groups

@article{Sutherland2011StructureCA,
  title={Structure computation and discrete logarithms in finite abelian p-groups},
  author={Andrew V. Sutherland},
  journal={Math. Comput.},
  year={2011},
  volume={80},
  pages={477-500}
}
We present a generic algorithm for computing discrete logarithms in a finite abelian p-group H, improving the Pohlig—Hellman algorithm and its generalization to noncyclic groups by Teske. We then give a direct method to compute a basis for H without using a relation matrix. The problem of computing a basis for some or all of the Sylow p-subgroups of an arbitrary finite abelian group G is addressed, yielding a Monte Carlo algorithm to compute the structure of G using O(|G| 1/2 ) group operations… 

Tables from this paper

Generic algorithms for the discrete logarithm problem
TLDR
Generic algorithms for the discrete logarithm problem in the standard setting of a cyclic group 〈α〉 are considered, assuming throughout that N = |α| is known.
Sato-Tate groups of y^2=x^8+c and y^2=x^7-cx
We consider the distribution of normalized Frobenius traces for two families of genus 3 hyperelliptic curves over Q that have large automorphism groups: y^2=x^8+c and y^2=x^7-cx with c in Q*. We give
Sato–Tate distributions and Galois endomorphism modules in genus 2
Abstract For an abelian surface A over a number field k, we study the limiting distribution of the normalized Euler factors of the L-function of A. This distribution is expected to correspond to
On taking square roots without quadratic nonresidues over finite fields
TLDR
A novel idea to compute square roots over finite fields, without being given any quadratic nonresidue, and without assuming any unproven hypothesis is presented, which is deterministic and the proof is elementary.
Sato-Tate distributions
In this expository article we explore the relationship between Galois representations, motivic L-functions, Mumford-Tate groups, and Sato-Tate groups, and we give an explicit formulation of the
From the Birch and Swinnerton-Dyer conjecture to Nagao's conjecture
Let E be an elliptic curve over Q with discriminant ∆E . For primes p of good reduction, let Np be the number of points modulo p and write Np = p+1−ap. In 1965, Birch and Swinnerton-Dyer formulated a
Construction of all cubic function fields of a given square-free discriminant
For any square-free polynomial D over a finite field of characteristic at least 5, we present an algorithm for generating all cubic function fields of discriminant D. We also provide a count of all
SATO-TATE DISTRIBUTIONS
In this expository article we explore the relationship between Galois representations, motivic L-functions, Mumford-Tate groups, and Sato-Tate groups, and we give an explicit formulation of the
New Cube Root Algorithm Based on Third Order Linear Recurrence Relation in Finite Field
TLDR
A new cube root algorithm in finite field Fq with q a power of prime, which extends the Cipolla-Lehmer type algorithms is presented, which is inspired by the work of Müller on quadratic case.
Construction of All Cubic Fields of a Fixed Fundamental Discriminant (Renate Scheidler)
The complete collection of cubic fields with a given fundamental discriminant can be constructed from certain algebraic integers in the associated quadratic resolvent field. Berwick explained how
...
...

References

SHOWING 1-10 OF 52 REFERENCES
On some computational problems in finite abelian groups
TLDR
These algorithms are based on a modification of Shanks' baby-step giant-step strategy, and have the advantage that their computational complexity and storage requirements are relative to the actual order, discrete logarithm, or size of the group, rather than relative to an upper bound on the group order.
A space efficient algorithm for group structure computation
  • Edlyn Teske
  • Computer Science, Mathematics
    Math. Comput.
  • 1998
TLDR
A new algorithm is presented for computing the structure of a finite abelian group, which has to store only a fixed, small number of group elements, independent of the group order, and it is proved that the expected run time is O(√n) and the O-constants are determined.
The Pohlig-Hellman Method Generalized for Group Structure Computation
We present a new algorithm that extends the techniques of the Pohlig?Hellman algorithm for discrete logarithm computation to the following situation: given a finite Abelian group and group elements h
Groups St Andrews 1997 in Bath, I: A polynomial-time theory of black box groups I
TLDR
It is demonstrated that the “nonabelian normal structure” of matrix groups over finite fields can be mapped out in great detail by polynomial-time randomized (Monte Carlo) algorithms.
Order computations in generic groups
TLDR
It is proved that a generic algorithm can compute |α| for all α ∈ S ⊆ G in near linear time plus the cost of a single order computation with N = λ(S), and it is shown that in most cases the structure of an abelian group G can be determined using an additional O (Nδ/4 ) group operations, given an O ( Nδ ) bound on |G| = N.
Computing the structure of a finite abelian group
TLDR
An algorithm is presented that computes the structure of a finite abelian group G from a generating system M and executes O(|M|√|G|) group operations and stores O(√ |G |) group elements.
Lower Bounds for Discrete Logarithms and Related Problems
  • V. Shoup
  • Computer Science, Mathematics
    EUROCRYPT
  • 1997
TLDR
Lower bounds on the complexity of the discrete logarithm and related problems are proved that match the known upper bounds: any generic algorithm must perform Ω(p1/2) group operations, where p is the largest prime dividing the order of the group.
Quadratic class numbers and character sums
TLDR
An explicit version of Burgess' theorem valid for prime discriminants is given and, as an application, the class number of a 32-digit discriminant is computed.
On taking roots in finite fields
TLDR
The main result is shown that finding the least x such that x2 = a MOD(m) is NP-complete (even if m is factored).
Fast Exponentiation with Precomputation (Extended Abstract)
TLDR
This paper presents a practical method of speeding up cryptographic systems using precomputed values to reduce the number of multiplications needed, and allows the computation of gn for n < N in O(log N/log log N) group multiplications.
...
...