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