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 = b00000000000000000000000011000001 b = 0x000000c1 b = x⁷ + x⁶ + 1
10000000000 | 11000001 - 11000001 | 1 ----------- | 1000001000 | - 11000001 | 1 ----------- | 100001100 | - 11000001 | 1 ----------- | 10001110 | - 11000001 | 1 ----------- | 1001111 |
c_quotient = b00000000000000000000000000001111 c_quotient = 0x0000000f c_quotient = x³ + x² + x + 1
c_remainder = b00000000000000000000000001001111 c_remainder = 0x0000004f c_remainder = x⁶ + x³ + x² + x + 1