gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b00000000000000000000000001000000 a = 0x00000040 a = x⁶
b = b00000000000000000000011111011101 b = 0x000007dd b = x¹⁰ + x⁹ + x⁸ + x⁷ + x⁶ + x⁴ + x³ + x² + 1
1000000 | 11111011101
c_quotient = b00000000000000000000000000000000 c_quotient = 0x00000000 c_quotient = 0
c_remainder = b00000000000000000000000001000000 c_remainder = 0x00000040 c_remainder = x⁶