Basic Concepts in Number Theory and Finite Fields

• Euclid's Algorithm
• Euclid's Algorithm: Tabular Method
• Homework 4A
• Modular Arithmetic
• Modular Arithmetic Operations
• Modular Arithmetic Properties
• Homework 4B
• Group
• Cyclic Group
• Ring
• Homework 4C
• Field
• Finite Fields or Galois Fields
• GF(7) Multiplication Example
• Polynomial Arithmetic
• Polynomial Arithmetic with Mod 2 Coefficients
• Example GF(23)
• Computational Example in GF(2n)
• Homework 4D
• Using a Generator

Presentation slides in Adobe Acrobat Format: 1 slide/page

View Slides+Audio (on YouTube)
View Slides+Audio (Using Flash)

Right click and save to download Slides+Audio podcast.
Frequently asked questions about remote audio/video viewing