Basic Concepts in Number Theory and Finite Fields

Table of Contents

Basic Concepts in Number Theory and Finite Fields

Overview

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

Home Page: http://www.cse.wustl.edu/~jain/

Download entire presentation in Adobe Acrobat