gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b00000000000000000001000000000000 a = 0x00001000 a = x¹²
b = b00000000000000000000000101110001 b = 0x00000171 b = x⁸ + x⁶ + x⁵ + x⁴ + 1
1000000000000 | 101110001 - 101110001 | 1 ------------- | 11100010000 | - 000000000 | 0 - 101110001 | 1 ------------- | 1011010100 | - 101110001 | 1 ------------- | 110110 | - 000000000 | 0
c_quotient = b00000000000000000000000000010110 c_quotient = 0x00000016 c_quotient = x⁴ + x² + x
c_remainder = b00000000000000000000000000110110 c_remainder = 0x00000036 c_remainder = x⁵ + x⁴ + x² + x