gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000101010010000001100001011010001101100011 a = 0x000000548185a363 a = x³⁸ + x³⁶ + x³⁴ + x³¹ + x²⁴ + x²³ + x¹⁸ + x¹⁶ + x¹⁵ + x¹³ + x⁹ + x⁸ + x⁶ + x⁵ + x + 1
b = b0000000000000000000000000000111000011100110010111101000010011001 b = 0x0000000e1ccbd099 b = x³⁵ + x³⁴ + x³³ + x²⁸ + x²⁷ + x²⁶ + x²³ + x²² + x¹⁹ + x¹⁷ + x¹⁶ + x¹⁵ + x¹⁴ + x¹² + x⁷ + x⁴ + x³ + 1
101010010000001100001011010001101100011 | 111000011100110010111101000010011001 - 111000011100110010111101000010011001 | 1 --------------------------------------- | 10010001100111110110110010011110101011 | - 111000011100110010111101000010011001 | 1 --------------------------------------- | 1110000010100111101000110010111001111 | - 111000011100110010111101000010011001 | 1 --------------------------------------- | 101101011000111100010011111101 | - 000000000000000000000000000000000000 | 0
c_quotient = b0000000000000000000000000000000000000000000000000000000000001110 c_quotient = 0x000000000000000e c_quotient = x³ + x² + x
c_remainder = b0000000000000000000000000000000000101101011000111100010011111101 c_remainder = 0x000000002d63c4fd c_remainder = x²⁹ + x²⁷ + x²⁶ + x²⁴ + x²² + x²¹ + x¹⁷ + x¹⁶ + x¹⁵ + x¹⁴ + x¹⁰ + x⁷ + x⁶ + x⁵ + x⁴ + x³ + x² + 1