Lecturer - Prof. Nitin Saxena
Preliminaries and Notations
Euclid's algorithm and Chinese Remainder Thoerem
Fast polynomial multiplication
Fast Integer multiplication
Fast Integer Division
Matrix Multiplication
Polynomial factoring over finite fields - Berlakamp's algorithm
PFFF - Resultant. Berlekamp as a reduction method
PFFF - Cantor-Zassenhaus algorithm
PFFF - Coding Theory
PFFF - Bivariate polynomials
Blackbox multivariate factoring
Integral polynomial factoring
Primality testing (Randomized)
Primality testing (Deterministic) and RSA
Integer factoring