Class 13: Mastering Number Theory & Intro to Cryptography 🔐

In this class we discuss about quadratic residues, quadratic non residues, Ligendre symbols, Jacobi Symbols. Then we talk about Yes-Biased Monte Carlo Algorithm. Finally we discuss about the probabilistic primality testing algorithm known as Solovay Strassen Algorithm. Using SAGE programming, we implement the Solovay Strassen Algorithm and provide a demonstration which gives a prime which is more than 1000 bits long.