Abstract :
Two new binary Euclidean algorithms to calculate the greatest common divisor are given. An exhaustive search for all odd integers of moderate length shows that these algorithms use fewer iterations on the average than that the two presently known algorithms
