gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b00000000000000000000000000000001 a = 0x00000001 a = 1
b = b00000000000000000000000101110001 b = 0x00000171 b = x⁸ + x⁶ + x⁵ + x⁴ + 1
1 | 101110001
c_quotient = b00000000000000000000000000000000 c_quotient = 0x00000000 c_quotient = 0
c_remainder = b00000000000000000000000000000001 c_remainder = 0x00000001 c_remainder = 1