GALOIS FIELD ARITHMETIC
GF(2ⁿ) — finite fields over binary
n =
2 → GF(4)
3 → GF(8)
4 → GF(16)
5 → GF(32)
Primitive poly:
Addition Table
Multiplication Table
Calculator
Field Tower
GF(2ⁿ) elements are polynomials over GF(2) modulo an irreducible polynomial of degree n. Addition = XOR. Multiplication = polynomial multiply mod p(x).