Investigated the implementation of Pseudoprimes in the RSA encryption system. Developed a RSA code in Python using Fermat's Little Theorem as a prime generation source and compared results with conventional methods.
This projects done during PROJ 201 course of Sabanci University.
All rights are reversed.