Exercises in Python notebook to implement the RSA encryption algorithm, and figure out if huge numbers are primes via Fermat test.
Carmichael_numbers.ipynb : Checks whether given number is Carmichael or not. Also prints the 5th,etc Carmichael numbers.
Fermat_test_for primes.ipynb : Checks whether given number is Prime or not using a simple loop on the Fermat test.
RSA_Encryption.ipynb : Encrypts a given string using the RSA Encrytion key. Also decrypts immediately with the decryption key.
RSA_Encryption_with_ED_input.ipynb :
seccap_constants190624.py : Used in the above files, for declaring global constants (the input cases and keys).