This course introduces the arithmetic complexity of fundamental computations (e.g., integer multiplication, polynomial arithmetic, matrix operations) and their cryptographic applications. Students will analyze classical and modern algorithms (Karatsuba, FFT, modular exponentiation), derive complexity bounds (time/space), and evaluate tradeoffs in cryptographic implementations (RSA, ECC, lattice-based schemes).