A Paper-and-Pencil gcd Algorithm for Gaussian Integers

DOI10.2307/30044888MaRDI QIDQ5446307zbMATH OpenOpenAlexFDO

Authors Sándor Szabó

Publication date 6 March 2008

Published in The College Mathematics Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/30044888

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Quadratic extensions (11R11) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Performance of a GCD algorithm for Gaussian integers
• scientific article; zbMATH DE number 3853202
• A fast Euclidean algorithm for Gaussian integers
• On the number of divisions of the Euclidean algorithm applied to Gaussian integers
• An approximating k-ary GCD algorithm
• Computation of the GCD of polynomials using gaussian transformations and shifting
• scientific article; zbMATH DE number 1263309
• The accelerated integer GCD algorithm
• A modular integer GCD algorithm

Cited in

(4)

• Gaussian integers
• On the number of divisions of the Euclidean algorithm applied to Gaussian integers
• Finding Factors of Factor Rings over the Gaussian Integers
• ON THE CONSTRUCTION OF A PSE FOR GCD COMPUTATION

This page was built for publication: A Paper-and-Pencil gcd Algorithm for Gaussian Integers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5446307)