The Euclidean algorithm works with numbers of any size. To find the greatest common divisor of 77 and 187 using the Euclidean algorithm involves the process of long division, which you might have ...

The Extended Euclidean algorithm calculates an associated factor at each step. It is the final value of this factor, the modular multiplicative inverse, that is the private key—29 in this case.