 As noted above, the GCD equals the product of the prime factors shared by the two numbers "a" and "b".Present methods for prime factorization are also inefficient; many modern cryptography systems even rely on that inefficiency.The binary GCD algorithm is an efficient alternative that substitutes division with faster operations by exploiting the binary representation used by computers.