A collection of fundamental cryptographic and number-theoretic algorithms implemented in SageMath. This repository contains educational implementations of key algorithms used in modern cryptography and computational number theory. All algorithms were written as part of coursework at NYU.

Algorithms Included:

• Primality Testing: Miller-Rabin probabilistic primality test and AKS deterministic primality test
• Integer Factorization: Quadratic Sieve, Elliptic Curve Method (ECM), and Pollard's p-1 method
• Discrete Logarithm: Baby-step Giant-step algorithm for elliptic curve discrete logarithm problem (ECDLP)