Asymptotically fast GCD computation in ℤ[i]

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1838, Issue , 2000, Pages 595-613

  Weilert, André ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; NUMBER THEORY;

ABSOLUTE VALUES; BIT-OPERATIONS; COFACTORS; EUCLIDEAN; FAST ALGORITHMS; GAUSSIAN INTEGERS; GREATEST COMMON DIVISORS; TIME BOUND;

COMPUTATIONAL EFFICIENCY;

EID: 84946822595     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10722028_40     Document Type: Conference Paper

References (37)

1. R. P. Brent, Analysis of the binary Euclidean algorithm, Algorithms and Complexity: New Directions and Recent Results (J. F. Traub, ed.), Academic Press, New York, 1976, pp. 321-355.
2. E. Bach and J. Shallit, Algorithmic Number Theory, Volume I: Efficient Algorithms, Foundations of Computing, MIT Press, Cambridge, MA, USA, 1996.
3. B. F. Caviness, A Lehmer-Type Greatest Common Divisor Algorithm for Gaussian Integers, SIAM Review 15 (1973), no. 2, 414.
4. B. F. Caviness and G. E. Collins, Algorithms for Gaussian Integer Arithmetic, Proceedings of the ACM Symposium on Symbolic and Algebraic Computation, Yorktown Heights (1976), 36-45.
5. T. L. Heath, The Thirteen Books of Euclid’s Elements, second ed., vol. 2, Cambridge University Press, New York, 1956, Books III IX.
6. K. Ireland and M. Rosen, A Classical Introduction to Modern Number Theory, second ed., Graduate Texts in Mathematics, vol. 84, Springer-Verlag, Berlin, Heidelberg, New York, 1990.
7. T. Jebelean, A Generalization of the Binary GCD Algorithm, ISSAC’93: Proceedings of the 1993 International Symposium on Symbolic and Algebraic Computation (New York) (M. Bronstein, ed.), ACM Press, 1993, pp. 111116.
8. D. E. Knuth, Seminumerical Algorithms, third ed., The Art of Computer Programming, vol. 2, Addison-Wesley, Reading, MA, USA, 1998.
9. E. Kaltofen and H. Rolletschek, Computing Greatest Common Divisors and Tactorizations in Quadratic Number Tields, Math. Comp. 53 (1989), no. 188, 697-720.
10. D. H. Lehmer, Euclid’s Algorithm for Large Numbers, Amer. Math. Monthly 45 (1938), 227-233.
11. F. Lemmermeyer, The Euclidean Algorithm in Algebraic Number Fields, updat of a version published in Expo. Math. 13 (1995), 385-416, 1995.
12. F. Lemmermeyer, Reciprocity Laws. Their Evolution from Euler to Artin, unpublished manuscript, http://www.rzuser.uni-heidelberg.de/~hb3/rec.html, 1999.
13. H. W. Lenstra Jr., Lectures on Euclidean Rings, Bielefeld, 1974.
14. S. M. Meyer and J. P. Sorenson, Efficient Algorithms for Computing the Jacobi Symbol, J. Symbolic Comput. 26 (1998), no. 4, 509-523.
15. J. Neukirch, Algebraic Number Theory, Springer-Verlag, Berlin, Heidelberg, New York, 1999.
16. G. H. Norton, Extending the binary gcd algorithm, AAECC-3 (J. Calmet, ed.), Lecture Notes in Computer Science, vol. 229, 1985, pp. 363-372.
17. G. Norton, A Shift-Remainder GCD Algorithm, Proceedings of the 5th International Conference on Applied Algebra, Algebraic Algorithms and Error- Correcting Codes AAECC-5 (Berlin, Heidelberg, New York) (L. Huguet and A. Poli, eds.), Lecture Notes in Computer Science, vol. 356, Springer-Verlag, 1989, pp. 350-356.
18. H. Rolletschek, On the Number of Divisions of the Euclidean Algorithm Applied to Gaussian Lntegers, J. Symbolic Comput. 2 (1986), 261-291.
19. H. Rolletschek, Shortest division chains in imaginary quadratic number fields, Symbolic and algebraic computation: International Symposium IS- SAC '88, Rome, Italy, July 4-8, 1988: proceedings (Berlin, Heidelberg, London etc.) (P. (Patrizia) Gianni, ed.), Lecture Notes in Computer Science, vol. 358, Springer Verlag, 1989, Conference held jointly with AAECC-6., pp. 231-243.
20. H. Rolletschek, Shortest Division Chains in Imaginary Quadratic Number Fields, J. Symbolic Comput. 9 (1990), 321-354.
21. A. Schönhage, Schnelle Berechnung von Kettenbruchentwicklungen, Acta Informatica 1 (1971), 139-144.
22. A. Schönhage, IGCDOC, Computation of integer gcd’s, unpublished manuscript, 1987.
23. A. Schönhage, Fast Reduction and Composition of Binary Quadratic Forms, Proc. Int’l. Symp. on Symbolic and Algebraic Computation: ISSAC '91 (S. M. Watt, ed.), ACM Press, 1991, pp. 128-133.
24. A. Schönhage, A. F. W. Grotefeld, and E. Vetter, Fast Algorithms - A Multitape Turing Machine Implementation, BI Wissenschaftsverlag, Mannheim, 1994.
25. M. S. Sedjelmaci and C. Lavault, Improvements on the Accelerated Integer GCD Algorithm, Inform. Process. Lett. 61 (1997), 31-36.
26. J. P. Sorenson, The k-ary GCD Algorithm, Technical Report CS-TR-90-979, University of Wisconsin, Madison, 1990.
27. J. Sorenson, Two Tast GCD Algorithms, J. Algorithms 16 (1994), no. 1, 110-144.
28. J. Sorenson, An Analysis of Lehmer’s Euclidean GCD Algorithm, Proceedings of the ACM International Symposium on Symbolic and Algebraic Computation ISSAC’95 (1995), 254-258.
29. A. Schönhage and V. Strassen, Schnelle Multiplikation großer Zahlen, Computing 7 (1971), 281-292.
30. J. Shallit and J. Sorenson, Analysis of a Left-Shift Binary GCD Algorithm, Proceedings of the First International Symposium "Algorithmic Number Theory" ANTS-I (Berlin, Heidelberg, New York) (L. M. Adleman and M.-D. Huang, eds.), Lecture Notes in Computer Science, vol. 877, Springer-Verlag, 1994, pp. 169-183.
31. J. Shallit and J. Sorenson, Analysis of a Left-Shift Binary GCD Algorithm, J. Symbolic Comput. 17 (1994), no. 6, 473-486.
32. J. Stein, Computational problems associated with Racah algebra, J. Comput. Phys. 1 (1967), 397-405.
33. B. Vallée, The Complete Analysis of the Binary Euclidean Algorithm, Proceedings of the Third International Symposium "Algorithmic Number Theory" ANTS-III (Berlin, Heidelberg, New York) (J. P. Buhler, ed.), Lecture Notes in Computer Science, vol. 1423, Springer-Verlag, 1998, pp. 77-94.
34. K. Weber, The accelerated integer GCD algorithm, ACM Trans. Math. Software 21 (1995), 111-122.
35. A. Weilert, Asymptotisch schnelle g.g.T.-Berechnung im Ring der Gaußschen Zahlen ℤ[i], Diplomarbeit, Institut für Informatik, Universität Bonn, 1999.
36. A. Weilert, Ein schneller Algorithmus zur Berechnung des quartischen Restsymbols, Diplomarbeit, Mathematisches Institut, Universität Bonn, 1999.
37. A. Weilert, (1 + i)-adic GCD Computation in ℤ[i] as an Analogue to the Binary GCD Algorithm, Proceedings of the Seventh Rhine Workshop on Computer Algebra RWCA’00 (T. Mulders, ed.), 2000, Bregenz, Austria, March 22-24, pp. 1-13.