This project implements the Rabin Cryptosystem in SageMath, a public-key encryption algorithm based on the integer factorization problem. The system uses blum primes for p and q to simplify the decryption process.
prime-factorizationsnumber-theoryinteger-factorizationsecure-communicationcryptographic-algorithmssagemathencryption-decryptionasymmetric-cryptographypublic-key-encryptionrabin-cryptosystemmathematical-cryptographycryptographic-securityalgorithm-im
-
Updated
Oct 14, 2024 - Jupyter Notebook