gf(2) Calculating the gcd (greatest common divisor)

Euclid's Algorithm

c = gcd(a₀,b₀)

a₀ = b0000000000000000000000000000000000000000000000000000000001100111 a₀ = 0x0000000000000067 a₀ = x⁶ + x⁵ + x² + x + 1
b₀ = b0000000000000000000000000000000000000000000000000000000000010001 b₀ = 0x0000000000000011 b₀ = x⁴ + 1

Find r₀ = a₀ % b₀

r₀ = b0000000000000000000000000000000000000000000000000000000000000001 r₀ = 0x0000000000000001 r₀ = 1

r₀ is one, so gcd(a,b) is one (i.e. coprime/relatively prime)