Binary GCD Like Algorithms for Some Complex Quadratic Rings

On the lines of the binary gcd algorithm for rational integers, algorithms for computing the gcd are presented for the ring of integers in Q( √ d) where d ∈ {−2, −7, −11, −19}. Thus a binary gcd like algorithm is presented for a unique factorization domain which is not Euclidean (case d = −19). Together with the earlier known binary gcd like algorithms for… CONTINUE READING