Search This Blog

Computational Number Theory

Computational Number Theory



Lecture 5 and 6:Chinese Remaindering[PDF][TeX]
Lecture 7:Towards Factorization over Finite Fields[PDF][TeX]
Lecture 8:More on Finite Fields[PDF][TeX]
Lecture 9:Uniqueness of F_q[PDF][TeX]
Lecture 10:Distinct Degree Factorization[PDF][TeX]
Lecture 11:Cantor-Zassenhaus Algorithm[PDF][TeX]
Lecture 12:Berlekamp's Algorithm[PDF][TeX]
(midsem 1 syllabus ends here)
Lecture 13:Codes: An Introduction[PDF][TeX]
Lecture 14:BCH Codes[PDF][TeX]
Midsem 1 (and solutions)[PDF]
Lecture 15 and 16:BCH Codes: Error correction[PDF][TeX]
Lecture 17:Primality is in NP and coNP[PDF][TeX]
Lecture 18:Quadratic Reciprocity[PDF][TeX]
Lecture 19:Quadratic Reciprocity (contd.)[PDF][TeX]
Lecture 20 and 21:Solovay-Strassen Primality Testing[PDF][TeX]
Lecture 22:A Discussion on ERH and Toward AKS[PDF][TeX]
Lecture 23 and 24:The Cyclotomic Polynomial[PDF][TeX]
Lecture 25:The AKS Primality Test[PDF][TeX]
Lecture 26:Hensel Lifting[PDF][TeX]
Lecture 27:Bivariate Factorization[PDF][TeX]