The Pohlig-Hellman Method Generalized for Group Structure Computation

Journal of Symbolic Computation

Volumn 27, Issue 6, 1999, Pages 521-534

  Teske, Edlyn ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042597629     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1999.0279     Document Type: Article

References (8)

1. Buchmann J., Jacobson, Jr M. J., Teske E. On some computational problems in finite Abelian groups. Math. Comput. 66:1997;1663-1687.
2. Hafner J. L., McCurley K. S. A rigorous subexponential algorithm for computation of class groups. J. Am. Math. Soc. 2:1989;839-850.
3. LiDIA.
4. S. Paulus, 1992.
5. Pohlig S. C., Hellman M. E. An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Trans. Inf. Theory. 24:1978;106-110.
6. Schoof R. J. Elliptic curves over finite fields and the computation of square roots modp. Math. Comput. 44:1985;483-494.
7. E. Teske, 1998a.
8. Teske E. A space efficient algorithm for group structure computation. Math. Comput. 67:1998b;1637-1663.