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.
Sund atiwaɗaqen daw ider, ən GCD eqalan ogdahan dǎɣ alil ən faəteurtan wi dazarnen azunen fal wi nəsin imaɗinan a əd b. Tabaraten ti amaradǎɣ ən afanaz ən maɗinan wi dazarnen aqalan intanedǎɣ winan aśohat; ajotnen əmikan ən əryɗtograɗhiquetan amutaynen taɣaymen dǎɣ fal iba naśahat wen.