Math in Network Security: A Crash Course

Changyu Dong

<cd04 at>

Table of Contents

1. Math and Security
2. Unique-Prime-Factorisation Theorem
3. Modular Arithmetic
4. Finite Fields
Groups, Modular Arithmetic and Finite Fields
Galois' Theorem and Polynomial Arithmetic
5. Elementary Number Theory
Fermat's little theorem
Euler's Totient Function and Euler's Theorem
6. Discrete Logarithms
Cyclic Groups and Generators
Discrete Logarithm Problem

List of Tables

3.1. Multiplication modulo 6
3.2. Multiplication modulo 5
4.1. Addition modulo x2+1
4.2. Multiplication modulo x2+1