This project involves an exploration of the RSA cryptosystem and the mathematical concepts embedded within it. The first goal is to explain what the cryptosystem consists of, and why it works. Additional goals include detailing some techniques for primality testing, discussing integer factorization, modular exponentiation, and digital signatures, and explaining the importance of these topics to the security and efficiency of the RSA cryptosystem. The final goal is to implement all of these components into a full simulation of the entire RSA cryptosystem using the Python programming language
