1. Crandall, R., Pomerance, C. The Prime Numbers: A Computational Perspective. 2nd Ed. (Springer-Verlag, Berlin, 2005; URRS,Moscow, 2011).
2. Sorenson, J. “The k-Ary GCD Algorithm”, University ofWisconsin-Madison, Tech. Report, 1–20 (1990).
3. Sorenson, J. “Two Fast GCD Algorithms”, J. Algorithms 16, No. 1, 110–144 (1994).
4. Weber, K. “The Accelerated Integer GCD Algorithm”, ACMTrans.Math. Software 21, No. 1, 1–12 (1995).
5. Jebelean, T. “A Generalization of the Binary GCD Algorithm”, Proc. of Intern. Symp. on Symb. and Algebr. Comp. (ISSAC’93), 111–116 (1993).