gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000001000000000000000000000000000000000000000000 a = 0x0000040000000000 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
1000000000000000000000000000000000000000000 | 11101011111100101000001100011111 - 11101011111100101000001100011111 | 1 ------------------------------------------- | 110101111110010100000110001111100000000000 | - 11101011111100101000001100011111 | 1 ------------------------------------------- | 1111000001011110000101001000010000000000 | - 00000000000000000000000000000000 | 0 - 11101011111100101000001100011111 | 1 ------------------------------------------- | 1101110101100100101111001101100000000 | - 00000000000000000000000000000000 | 0 - 00000000000000000000000000000000 | 0 - 11101011111100101000001100011111 | 1 ------------------------------------------- | 11011010010110001111111100011100000 | - 00000000000000000000000000000000 | 0 - 11101011111100101000001100011111 | 1 ------------------------------------------- | 110001101010100111110000000011000 | - 00000000000000000000000000000000 | 0 - 11101011111100101000001100011111 | 1 ------------------------------------------- | 1011010101101101110011000100110 | - 00000000000000000000000000000000 | 0
c_quotient = b0000000000000000000000000000000000000000000000000000110100101010 c_quotient = 0x0000000000000d2a c_quotient = x¹¹ + x¹⁰ + x⁸ + x⁵ + x³ + x
c_remainder = b0000000000000000000000000000000001011010101101101110011000100110 c_remainder = 0x000000005ab6e626 c_remainder = x³⁰ + x²⁸ + x²⁷ + x²⁵ + x²³ + x²¹ + x²⁰ + x¹⁸ + x¹⁷ + x¹⁵ + x¹⁴ + x¹³ + x¹⁰ + x⁹ + x⁵ + x² + x