gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000000000010000000000000000000000000000 a = 0x0000000010000000 a = x²⁸
b = b0000000000000000000000000000000000000000001001111000101010011001 b = 0x0000000000278a99 b = x²¹ + x¹⁸ + x¹⁷ + x¹⁶ + x¹⁵ + x¹¹ + x⁹ + x⁷ + x⁴ + x³ + 1
10000000000000000000000000000 | 1001111000101010011001 - 1001111000101010011001 | 1 ----------------------------- | 11110001010100110010000000 | - 0000000000000000000000 | 0 - 0000000000000000000000 | 0 - 1001111000101010011001 | 1 ----------------------------- | 1101111011110010100010000 | - 1001111000101010011001 | 1 ----------------------------- | 100000011011000111011000 | - 1001111000101010011001 | 1 ----------------------------- | 111111001101110111100 | - 0000000000000000000000 | 0 - 0000000000000000000000 | 0
c_quotient = b0000000000000000000000000000000000000000000000000000000010011100 c_quotient = 0x000000000000009c c_quotient = x⁷ + x⁴ + x³ + x²
c_remainder = b0000000000000000000000000000000000000000000111111001101110111100 c_remainder = 0x00000000001f9bbc c_remainder = x²⁰ + x¹⁹ + x¹⁸ + x¹⁷ + x¹⁶ + x¹⁵ + x¹² + x¹¹ + x⁹ + x⁸ + x⁷ + x⁵ + x⁴ + x³ + x²