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 = b00000000000000000000011111011101 b = 0x000007dd b = x¹⁰ + x⁹ + x⁸ + x⁷ + x⁶ + x⁴ + x³ + x² + 1
1000000000000 | 11111011101 - 11111011101 | 1 ------------- | 111101110100 | - 11111011101 | 1 ------------- | 11001110 | - 00000000000 | 0
c_quotient = b00000000000000000000000000000110 c_quotient = 0x00000006 c_quotient = x² + x
c_remainder = b00000000000000000000000011001110 c_remainder = 0x000000ce c_remainder = x⁷ + x⁶ + x³ + x² + x