Modules / Lectures
Module NameDownload
noc20_ma42_assignment_Week_0noc20_ma42_assignment_Week_0
noc20_ma42_assignment_Week_1noc20_ma42_assignment_Week_1
noc20_ma42_assignment_Week_10noc20_ma42_assignment_Week_10
noc20_ma42_assignment_Week_11noc20_ma42_assignment_Week_11
noc20_ma42_assignment_Week_12noc20_ma42_assignment_Week_12
noc20_ma42_assignment_Week_2noc20_ma42_assignment_Week_2
noc20_ma42_assignment_Week_3noc20_ma42_assignment_Week_3
noc20_ma42_assignment_Week_4noc20_ma42_assignment_Week_4
noc20_ma42_assignment_Week_5noc20_ma42_assignment_Week_5
noc20_ma42_assignment_Week_6noc20_ma42_assignment_Week_6
noc20_ma42_assignment_Week_7noc20_ma42_assignment_Week_7
noc20_ma42_assignment_Week_8noc20_ma42_assignment_Week_8
noc20_ma42_assignment_Week_9noc20_ma42_assignment_Week_9


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

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


Sl.No Language Book link
1EnglishNot Available
2BengaliNot Available
3GujaratiNot Available
4HindiNot Available
5KannadaNot Available
6MalayalamNot Available
7MarathiNot Available
8TamilNot Available
9TeluguNot Available