gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000010000000000000000000000000000000000 a = 0x0000000400000000 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
10000000000000000000000000000000000 | 11101011111100101000001100011111 - 11101011111100101000001100011111 | 1 ----------------------------------- | 1101011111100101000001100011111000 | - 11101011111100101000001100011111 | 1 ----------------------------------- | 11110000010111100001010010000100 | - 00000000000000000000000000000000 | 0 - 11101011111100101000001100011111 | 1 ----------------------------------- | 11011101011001001011110011011 |
c_quotient = b0000000000000000000000000000000000000000000000000000000000001101 c_quotient = 0x000000000000000d c_quotient = x³ + x² + 1
c_remainder = b0000000000000000000000000000000000011011101011001001011110011011 c_remainder = 0x000000001bac979b c_remainder = x²⁸ + x²⁷ + x²⁵ + x²⁴ + x²³ + x²¹ + x¹⁹ + x¹⁸ + x¹⁵ + x¹² + x¹⁰ + x⁹ + x⁸ + x⁷ + x⁴ + x³ + x + 1