To find the greatest common divisor of 77 and 187 using the Euclidean algorithm involves the process of long division, which you might have first encountered in elementary school. Divide 77 into ...

This module covers a brief recap of elementary number theory, GCD, Euclid's algorithm, Bezout coefficients and presents the RSA public key cryptosystem. It then shows how the security of RSA relies on ...