How does GF(2⁸) multiplication work?

GF(2⁸) multiplication is a key operation in AES encryption. It follows these steps:

  1. Convert operands to binary polynomials
  2. Multiply the polynomials using standard polynomial multiplication
  3. Reduce the result modulo the irreducible polynomial x⁸ + x⁴ + x³ + x + 1 (0x11B in hex)

This calculator implements the efficient "Russian Peasant Multiplication" algorithm to perform this operation.

Matrix 1

Default: AES MixColumns transformation matrix

Matrix 2