The binary GCD algorithm has also been extended to domains other than natural numbers, such as Gaussian integers,[1] Eisenstein integers,[2] quadratic rings,[3][4] and arbitrary unique factorisation domains.[5]