 Ciro Santilli \$£ Sponsor €¥ 中国独裁统治 China Dictatorship 新疆改造中心、六四事件、法轮功、郝海东、709大抓捕、2015巴拿马文件 邓家贵、低端人口、西藏骚乱

# GF(4)

Ciro Santilli tried to add this example to Wikipedia, but revert, so here we are.
This is a good first example of a field of a finite field of non-prime order, this one is a prime power order instead.
, so one way to represent the elements of the field will be the to use the 4 polynomials of degree 1 over GF(2):
• 0X + 0
• 0X + 1
• 1X + 0
• 1X + 1
Note that we refer in this definition to anther field, but that is fine, because we only refer to fields of prime order such as GF(2), because we are dealing with prime powers only. And we have already defined fields of prime order easily previously with modular arithmetic.
Over GF(2), there is only one irreducible polynomial of degree 2: $$X2+X+1 (5)$$
Addition is defined element-wise with modular arithmetic modulo 2 as defined over GF(2), e.g.: $$(1X+0)+(1X+1)=(1+1)X+(0+1)=0X+1 (6)$$
Multiplication is done modulo , which ensures that the result is also of degree 1.
For example first we do a regular multiplication: $$(1X+0)×(1X+1)=(1×1)X2+(1×1)X+(0×1)X+(0×1)=1X2+1X+0 (7)$$
Without modulo, that would not be one of the elements of the field anymore due to the !
So we take the modulo, we note that: $$1X2+1X+0=1(X2+X+1)+(0X+1) (8)$$ and by the definition of modulo: $$(1X2+1X+0)mod(X2+X+1)=(0X+1) (9)$$ which is the final result of the multiplication.
TODO show how taking a reducible polynomial for modulo fails. Presumably it is for a similar reason to why things fail for the prime case.