gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000100000000000000000000000000000000000000 a = 0x0000004000000000 a = x³⁸
b = b0000000000000000000000000000000011101011111100101000001100011111 b = 0x00000000ebf2831f b = x³¹ + x³⁰ + x²⁹ + x²⁷ + x²⁵ + x²⁴ + x²³ + x²² + x²¹ + x²⁰ + x¹⁷ + x¹⁵ + x⁹ + x⁸ + x⁴ + x³ + x² + x + 1
100000000000000000000000000000000000000 | 11101011111100101000001100011111 - 11101011111100101000001100011111 | 1 --------------------------------------- | 11010111111001010000011000111110000000 | - 11101011111100101000001100011111 | 1 --------------------------------------- | 111100000101111000010100100001000000 | - 00000000000000000000000000000000 | 0 - 11101011111100101000001100011111 | 1 --------------------------------------- | 110111010110010010111100110110000 | - 00000000000000000000000000000000 | 0 - 00000000000000000000000000000000 | 0 - 11101011111100101000001100011111 | 1 --------------------------------------- | 1101101001011000111111110001110 | - 00000000000000000000000000000000 | 0
c_quotient = b0000000000000000000000000000000000000000000000000000000011010010 c_quotient = 0x00000000000000d2 c_quotient = x⁷ + x⁶ + x⁴ + x
c_remainder = b0000000000000000000000000000000001101101001011000111111110001110 c_remainder = 0x000000006d2c7f8e c_remainder = x³⁰ + x²⁹ + x²⁷ + x²⁶ + x²⁴ + x²¹ + x¹⁹ + x¹⁸ + x¹⁴ + x¹³ + x¹² + x¹¹ + x¹⁰ + x⁹ + x⁸ + x⁷ + x³ + x² + x