Write ups on Mathematical Cryptography

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.

A SageMath implementation of Edwards-Curve Digital Signature Algorithm (EdDSA), featuring secure key generation, signing, and verification. Focused on Cryptographic Primitives and highly efficient, scalable algorithms.

Curve25519 and Secp256k1 plot from Weierstrass Polynomial Form. Key topics covered include - Elliptic Curve Cryptography (ECC) - Cryptographic Curves