Finite field of non-prime order

9 = 3 \times 3

. Basically, for order

p^{n}

, we take:

each element is a polynomial in $G F (p) [x]$ , $G F (p) [x]$ , the polynomial ring over the finite field $G F (p)$ with degree smaller than $n$ . We've just seen how to construct $G F (p)$ for prime $p$ above, so we're good there.
addition works element-wise modulo on $G F (p)$
multiplication is done modulo an irreducible polynomial of order $n$

For a worked out example, see: GF(4).

 Ancestors (8)

There are no discussions about this article yet.

There are currently no matching articles.