← All problems

Galois Field Multiplier

Medium · Combinational · SystemVerilog · VHDL

A premium problem. Subscribe to open it in the editor, run the testbench and see where your design lands.

Design a multiplier for the finite field GF(2^8) defined by the AES polynomial.

An element of GF(2^8) is an 8-bit value read as a polynomial with one-bit coefficients: bit i is the coefficient of x^i. Adding two elements is a bitwise XOR, and their product is the polynomial product, with coefficients combined by XOR, reduced modulo an irreducible polynomial of degree 8 so that it fits in 8 bits again. This arithmetic is at the core of AES MixColumns and of Reed-Solomon and BCH codes.

product is the field product of a and b, reduced modulo x^8 + x^4 + x^3 + x + 1 (9'h11B). POLY names that polynomial and is fixed at its default.

The module is combinational.

  • Arithmetic

Open this challenge in the editor →