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 = b0000000000000000000000000000000011101011111100101000001100011111 b = 0x00000000ebf2831f b = x³¹ + x³⁰ + x²⁹ + x²⁷ + x²⁵ + x²⁴ + x²³ + x²² + x²¹ + x²⁰ + x¹⁷ + x¹⁵ + x⁹ + x⁸ + x⁴ + x³ + x² + x + 1
1000000000000000000000000000000000000 | 11101011111100101000001100011111 - 11101011111100101000001100011111 | 1 ------------------------------------- | 110101111110010100000110001111100000 | - 11101011111100101000001100011111 | 1 ------------------------------------- | 1111000001011110000101001000010000 | - 00000000000000000000000000000000 | 0 - 11101011111100101000001100011111 | 1 ------------------------------------- | 1101110101100100101111001101100 | - 00000000000000000000000000000000 | 0 - 00000000000000000000000000000000 | 0
c_quotient = b0000000000000000000000000000000000000000000000000000000000110100 c_quotient = 0x0000000000000034 c_quotient = x⁵ + x⁴ + x²
c_remainder = b0000000000000000000000000000000001101110101100100101111001101100 c_remainder = 0x000000006eb25e6c c_remainder = x³⁰ + x²⁹ + x²⁷ + x²⁶ + x²⁵ + x²³ + x²¹ + x²⁰ + x¹⁷ + x¹⁴ + x¹² + x¹¹ + x¹⁰ + x⁹ + x⁶ + x⁵ + x³ + x²