Example of binary GCD for complex integers?

100 Views Asked by At

I know you can use bit shifting to speed up the GCD algorithm for a pair of integers. Is there a way to apply this idea to gaussian integers?