gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b00000000000000000000010000000000 a = 0x00000400 a = x¹⁰
b = b00000000000000000000000001100111 b = 0x00000067 b = x⁶ + x⁵ + x² + x + 1
10000000000 | 1100111 - 1100111 | 1 ----------- | 1001110000 | - 1100111 | 1 ----------- | 101001000 | - 1100111 | 1 ----------- | 11010100 | - 1100111 | 1 ----------- | 11010 | - 0000000 | 0
c_quotient = b00000000000000000000000000011110 c_quotient = 0x0000001e c_quotient = x⁴ + x³ + x² + x
c_remainder = b00000000000000000000000000011010 c_remainder = 0x0000001a c_remainder = x⁴ + x³ + x