The Math Behind RSA #3: Implementing RSA from Scratch in Python

python dev.to

This article has a more math-focused version with formal proofs on Folio. In the first two parts of this series, we built up the number theory toolkit: modular arithmetic, Euler's totient function, the extended Euclidean algorithm, and Fermat's little theorem. Now it's time to put all of that to work and implement RSA from scratch in Python. By the end of this article you will have a working RSA implementation, understand why each mathematical piece is needed, and see a formal proof that dec

Read Full Tutorial open_in_new
arrow_back Back to Tutorials