LFSR

LFSR uses a bitwise polynomial (ex: x^5 + x^2 + 1) to generate uniformly distributed pseudo random numbers over a given field (ex: 2^n).

Primitive polynomial

TODO

Why is LFSR uniformly distributed?

LFSR is uniformly distributed when the polynomial used is primitive polynomial. A primitive polynomial cycles over its field generating every number in the field (except zero) before repeating the same numbers. This makes it generate every number and do it uniformly. One drawback is that it cannot generate the same number twice during the same cycle.

TODO show example of 4-bit LFSR.