CSC478/2412 preliminary overview, Spring 1997

Updated January 14, 1997

Introduction to computer algebra, including applications. Fast algorithms for integers and polynomials: multiplication, division with remainder, greatest commod divisors and Euclid's Algorithm, Chinese Remainder Theorem computations, primality testing, irreducibility tests for polynomials, polynomial factorization.

Tools include modular arithmetic, the Discrete Fourier Transform, Newton iteration.

Applications include signal processing, error-correcting codes, and cryptography.


Although we will provide all the definitions required to complete the course, familiarity with abstract algebra is a definite asset.


Recommended reading

Back to CSC478/2412 home page
Back to David Neto's teaching page
Back to David Neto's home page