You are about to see a worked RSA example with p=61, q=53, the primes from the original 1977 RSA paper. The previous version of this article used p=3, q=7 and got d=5.0, which only decrypts by coincidence. The fixed version uses Rivest’s primes and computes d with the extended Euclidean algorithm. The version below fixes … Continue reading RSA Algorithm: Theory and Implementation in Python