gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000010000000000000000000000000000000000000000 a = 0x0000010000000000 a = x⁴⁰
b = b0000000000000000000000000000000010110000110000010101001011111001 b = 0x00000000b0c152f9 b = x³¹ + x²⁹ + x²⁸ + x²³ + x²² + x¹⁶ + x¹⁴ + x¹² + x⁹ + x⁷ + x⁶ + x⁵ + x⁴ + x³ + 1
10000000000000000000000000000000000000000 | 10110000110000010101001011111001 - 10110000110000010101001011111001 | 1 ----------------------------------------- | 110000110000010101001011111001000000000 | - 00000000000000000000000000000000 | 0 - 10110000110000010101001011111001 | 1 ----------------------------------------- | 11100111100010000011001000111010000000 | - 10110000110000010101001011111001 | 1 ----------------------------------------- | 1010111010010010110000011000011000000 | - 10110000110000010101001011111001 | 1 ----------------------------------------- | 1111001010011100100110111111100000 | - 00000000000000000000000000000000 | 0 - 00000000000000000000000000000000 | 0 - 10110000110000010101001011111001 | 1 ----------------------------------------- | 100001001011101110010010000000100 | - 10110000110000010101001011111001 | 1 ----------------------------------------- | 1101000111101011000000111110110 | - 00000000000000000000000000000000 | 0
c_quotient = b0000000000000000000000000000000000000000000000000000001011100110 c_quotient = 0x00000000000002e6 c_quotient = x⁹ + x⁷ + x⁶ + x⁵ + x² + x
c_remainder = b0000000000000000000000000000000001101000111101011000000111110110 c_remainder = 0x0000000068f581f6 c_remainder = x³⁰ + x²⁹ + x²⁷ + x²³ + x²² + x²¹ + x²⁰ + x¹⁸ + x¹⁶ + x¹⁵ + x⁸ + x⁷ + x⁶ + x⁵ + x⁴ + x² + x