Exercises in Python notebook to implement the RSA encryption algorithm, and figure out if huge numbers are primes via Fermat test. Explanation provided via comments in Japanese.
security encryption decryption number-theory python-notebook rsa-encryption carmichael carmichael-numbers huge-numbers fermat-test
-
Updated
May 25, 2020 - Jupyter Notebook