1. J. Buchman and S. Paulus, “Algorithms for finite abelian groups,” in: Number Theoretic and Algebraic Methods in Computer Science, Conference Abstracts (1993), pp. 22–27.
2. D. Shanks, “Class number. A theory of factorization and genera,” in: Proc. Symp. Pure Math., Vol. 20, AMS (1970), pp. 415–440.
3. D. Knuth, The Art of Computer Programming [Russian translation], Vol. 3, Mir, Moscow (1978).
4. R. Lidl and H. Niederreiter, Introduction to Finite Fields and Their Applications, Cambridge University Press, Cambridge-New York-Melbourne-Sydney (1986).
5. S. C. Pohlig and M. E. Hellman, “An improved algorithm for computing logarithms over GF(p) and its cryptographic significance,” IEEE. Trans. Information Theory,24, 106–110 (1978).