Galois Finite Fields and the Advanced Encryption Standard (AES)

Automated excerpt

For example, we might do the obvious thing and represent numbers like 0 or 1 with the polynomial 0 or 1. Here's a multiplication table for GF(24), using a reduction polynomial of 0x13 == 10011 == x4+x+1. (See some more detailed GF(16) examples here. )0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 and multiply by the inverse. The affine transformation fixes the problem with 0 (no ShiftRows shifts each byte horizontally in the 4x4 grid. transformation on each column.

Selected automatically from source text; not independently written or fact-checked. Read the original for full context.