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-factorizations number-theory integer-factorization secure-communication cryptographic-algorithms sagemath encryption-decryption asymmetric-cryptography public-key-encryption rabin-cryptosystem mathematical-cryptography cryptographic-security algorithm-im
-
Updated
Oct 14, 2024 - Jupyter Notebook