1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The design and analysis of computer algorithms. Addison-Wesley, Reading (1975)
2. Anshel, M., Goldfeld, D.: Zeta functions, one-way functions, and pseudoran- dom number generators. Duke Math. J. 88, 371–390 (1997)
3. Bach, E., Shallit, J.: Algorithmic number theory. MIT Press, Cambridge (1996)
4. Biham, E., Boneh, D., Reingold, O.: Breaking generalized Diffie-Hellman modulo a composite is not weaker than factoring. Inform. Proc. Letters 70, 83–87 (1999)
5. Cohen, H.: A course in Computational Algebraic Number Theory. Springer, Berlin (1997)