Handouts
CMSC 443

Spring Semester 2012

Handout 1 A Substitution Cipher to be broken
Handout 2 The extended Euclidean algorithm
Handout 3 Permutation Examples
Handout 4 Finite Field Log/AntiLog Tables
Handout 4a An Example of a Log/AntiLog Table Calculation
Handout 5 Peterson's Table of Irreducible Polynomials over GF(2)
Handout 6 Peterson's Chapter on Linear Sequential Circuits
Handout 7 Project on Implementing Finite Fields
Handout 8 Garner's Algorithm for CRT
Handout 9 An Example of Garner's Algorithm

Last Modified: January 25, 2012