Sakadi sané kabaosang ring ajeng, FPB pateh tekén produk saking faktor prima sané kapalihang olih kalih angka a miwah b. Metode sané wénten ritepengan kadi mangkin anggén faktorisasi prima taler nénten efisien; akéh sistem kriptografi modern sané magantung sareng kanéntenefisienan punika.
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.