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 = b00000000000000000000000011000001 b = 0x000000c1 b = x⁷ + x⁶ + 1
1000000000000 | 11000001 - 11000001 | 1 ------------- | 100000100000 | - 11000001 | 1 ------------- | 10000110000 | - 11000001 | 1 ------------- | 1000111000 | - 11000001 | 1 ------------- | 100111100 | - 11000001 | 1 ------------- | 10111110 | - 11000001 | 1 ------------- | 1111111 |
c_quotient = b00000000000000000000000000111111 c_quotient = 0x0000003f c_quotient = x⁵ + x⁴ + x³ + x² + x + 1
c_remainder = b00000000000000000000000001111111 c_remainder = 0x0000007f c_remainder = x⁶ + x⁵ + x⁴ + x³ + x² + x + 1