\((1+i)\)-ary GCD computation in \(\mathbb Z[i]\) as an analogue to the binary GCD algorithm.

DOI10.1006/jsco.2000.0422zbMath1053.11093OpenAlexW1965555407MaRDI QIDQ5926303

Weilert, André

Publication date: 2000

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.2000.0422

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Number-theoretic algorithms; complexity (11Y16)

Related Items

Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers, Two efficient algorithms for the computation of ideal sums in quadratic orders, Lower bounds for decision problems in imaginary, norm-Euclidean quadratic integer rings, A fast Euclidean algorithm for Gaussian integers, Fast computation of the biquadratic residue symbol.

Uses Software

• CALYPSO

Cites Work

• The number of steps in the Euclidean algorithm over complex quadratic fields
• On the number of divisions of the Euclidean algorithm applied to Gaussian integers
• Algorithmic number theory. 3rd international symposium, ANTS-III, Portland, OR, USA, June 21--25, 1998. Proceedings
• ISSAC '88, Proceedings of the International Symposium on Symbolic and Algebraic Computation. Rome, Italy, July 4--8, 1988.
• Shortest division chains in imaginary quadratic number fields
• Computational problems associated with Racah algebra
• Fast multiplication of large numbers
• Fast computation of continued fraction expansions.
• Parallel implementation of the accelerated integer GCD algorithm
• Computing Gretest Common Divisors and Factorizations in Quadratic Number Fields
• Two Fast GCD Algorithms
• The accelerated integer GCD algorithm
• Euclid's Algorithm for Large Numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item