| Sl.No | Chapter Name | MP4 Download |
|---|---|---|
| 1 | Lecture 1: Introduction: Computation and Algebra | Download |
| 2 | Lecture 2: Background | Download |
| 3 | Lecture 3: GCD algorithm and Chinese Remainder Theorem | Download |
| 4 | Lecture 4: Fast polynomial multiplication | Download |
| 5 | Lecture 5: Fast polynomial multiplication (contd.) | Download |
| 6 | Lecture 6: Fast integer multiplication and division | Download |
| 7 | Lecture 7: Fast integer arithmetic and matrix multiplication | Download |
| 8 | Lecture 8: Matrix Multiplication Tensor. | Download |
| 9 | Polynomial factoring over finite fields: Irreducibility testing | Download |
| 10 | Equi-degree factorization and idea of Berlekamp's algorithm | Download |
| 11 | Lecture 11: Berlekamp's algorithm as a reduction method | Download |
| 12 | Lecture 12: Factoring over finite fields: Cantor-Zassenhaus algorithm | Download |
| 13 | Lecture 13: Reed Solomon Error Correcting Codes | Download |
| 14 | Lecture 14: List Decoding | Download |
| 15 | Lecture 15: Bivariate Factorization - Hensel Lifting | Download |
| 16 | Lecture 16: Bivariate polynomial factoring (continued) | Download |
| 17 | Lecture 17: Multivariate Polynomial Factorization | Download |
| 18 | Lecture 18: Multivariate Factoring - Hilbert's Irreducibility Theorem | Download |
| 19 | Lecture 19: Multivariate factoring (continued) | Download |
| 20 | Lecture 20: Analysis of LLL algorithm. | Download |
| 21 | Lecture 21: Analysis of LLL algorithm (continued) | Download |
| 22 | Lecture 22: Analysis of LLL-reduced basis algorithm and Introduction to NTRU cryptosystem | Download |
| 23 | Lecture 23: NTRU cryptosystem (continued) and Introduction to Primality testing | Download |
| 24 | Lecture 24: Randomized Primality testing: Solovay-Strassen and Miller-Rabin tests | Download |
| 25 | Lecture 25: Deterministic primality test (AKS) and RSA cryptosystem | Download |
| 26 | Lecture 26: Integer factoring: Smooth numbers and Pollard's rho method | Download |
| 27 | Lecture 27: Pollard's p-1, Fermat, Morrison-Brillhart, Quadratic and Number field sieve methods | Download |
| Sl.No | Chapter Name | English |
|---|---|---|
| 1 | Lecture 1: Introduction: Computation and Algebra | Download To be verified |
| 2 | Lecture 2: Background | Download To be verified |
| 3 | Lecture 3: GCD algorithm and Chinese Remainder Theorem | Download To be verified |
| 4 | Lecture 4: Fast polynomial multiplication | Download To be verified |
| 5 | Lecture 5: Fast polynomial multiplication (contd.) | Download To be verified |
| 6 | Lecture 6: Fast integer multiplication and division | Download To be verified |
| 7 | Lecture 7: Fast integer arithmetic and matrix multiplication | Download To be verified |
| 8 | Lecture 8: Matrix Multiplication Tensor. | Download To be verified |
| 9 | Polynomial factoring over finite fields: Irreducibility testing | PDF unavailable |
| 10 | Equi-degree factorization and idea of Berlekamp's algorithm | PDF unavailable |
| 11 | Lecture 11: Berlekamp's algorithm as a reduction method | PDF unavailable |
| 12 | Lecture 12: Factoring over finite fields: Cantor-Zassenhaus algorithm | PDF unavailable |
| 13 | Lecture 13: Reed Solomon Error Correcting Codes | PDF unavailable |
| 14 | Lecture 14: List Decoding | PDF unavailable |
| 15 | Lecture 15: Bivariate Factorization - Hensel Lifting | PDF unavailable |
| 16 | Lecture 16: Bivariate polynomial factoring (continued) | PDF unavailable |
| 17 | Lecture 17: Multivariate Polynomial Factorization | PDF unavailable |
| 18 | Lecture 18: Multivariate Factoring - Hilbert's Irreducibility Theorem | PDF unavailable |
| 19 | Lecture 19: Multivariate factoring (continued) | PDF unavailable |
| 20 | Lecture 20: Analysis of LLL algorithm. | PDF unavailable |
| 21 | Lecture 21: Analysis of LLL algorithm (continued) | PDF unavailable |
| 22 | Lecture 22: Analysis of LLL-reduced basis algorithm and Introduction to NTRU cryptosystem | PDF unavailable |
| 23 | Lecture 23: NTRU cryptosystem (continued) and Introduction to Primality testing | PDF unavailable |
| 24 | Lecture 24: Randomized Primality testing: Solovay-Strassen and Miller-Rabin tests | PDF unavailable |
| 25 | Lecture 25: Deterministic primality test (AKS) and RSA cryptosystem | PDF unavailable |
| 26 | Lecture 26: Integer factoring: Smooth numbers and Pollard's rho method | PDF unavailable |
| 27 | Lecture 27: Pollard's p-1, Fermat, Morrison-Brillhart, Quadratic and Number field sieve methods | PDF unavailable |
| Sl.No | Language | Book link |
|---|---|---|
| 1 | English | Not Available |
| 2 | Bengali | Not Available |
| 3 | Gujarati | Not Available |
| 4 | Hindi | Not Available |
| 5 | Kannada | Not Available |
| 6 | Malayalam | Not Available |
| 7 | Marathi | Not Available |
| 8 | Tamil | Not Available |
| 9 | Telugu | Not Available |