gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000000111010111111001010000011000111110 a = 0x00000001d7e5063e a = x³² + x³¹ + x³⁰ + x²⁸ + x²⁶ + x²⁵ + x²⁴ + x²³ + x²² + x²¹ + x¹⁸ + x¹⁶ + x¹⁰ + x⁹ + x⁵ + x⁴ + x³ + x² + 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
111010111111001010000011000111110 | 11101011111100101000001100011111 - 11101011111100101000001100011111 | 1 --------------------------------- | 0 | - 00000000000000000000000000000000 | 0
c_quotient = b0000000000000000000000000000000000000000000000000000000000000010 c_quotient = 0x0000000000000002 c_quotient = x
c_remainder = b0000000000000000000000000000000000000000000000000000000000000000 c_remainder = 0x0000000000000000 c_remainder = 0