Write ups on Mathematical Cryptography
-
Updated
Jan 24, 2025 - SCSS
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.
Curve25519 and Secp256k1 plot from Weierstrass Polynomial Form. Key topics covered include - Elliptic Curve Cryptography (ECC) - Cryptographic Curves
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.
Add a description, image, and links to the mathematical-cryptography topic page so that developers can more easily learn about it.
To associate your repository with the mathematical-cryptography topic, visit your repo's landing page and select "manage topics."