gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000001000000000000000000000000000000000000 a = 0x0000001000000000 a = x³⁶
b = b0000000000000000000000000000000010110000110000010101001011111001 b = 0x00000000b0c152f9 b = x³¹ + x²⁹ + x²⁸ + x²³ + x²² + x¹⁶ + x¹⁴ + x¹² + x⁹ + x⁷ + x⁶ + x⁵ + x⁴ + x³ + 1
1000000000000000000000000000000000000 | 10110000110000010101001011111001 - 10110000110000010101001011111001 | 1 ------------------------------------- | 11000011000001010100101111100100000 | - 00000000000000000000000000000000 | 0 - 10110000110000010101001011111001 | 1 ------------------------------------- | 1110011110001000001100100011101000 | - 10110000110000010101001011111001 | 1 ------------------------------------- | 101011101001001011000001100001100 | - 10110000110000010101001011111001 | 1 ------------------------------------- | 111100101001110010011011111110 | - 00000000000000000000000000000000 | 0
c_quotient = b0000000000000000000000000000000000000000000000000000000000101110 c_quotient = 0x000000000000002e c_quotient = x⁵ + x³ + x² + x
c_remainder = b0000000000000000000000000000000000111100101001110010011011111110 c_remainder = 0x000000003ca726fe c_remainder = x²⁹ + x²⁸ + x²⁷ + x²⁶ + x²³ + x²¹ + x¹⁸ + x¹⁷ + x¹⁶ + x¹³ + x¹⁰ + x⁹ + x⁷ + x⁶ + x⁵ + x⁴ + x³ + x² + x