gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000101010001010101010100010001 a = 0x00000000000000000000000005455511 a = x²⁶ + x²⁴ + x²² + x¹⁸ + x¹⁶ + x¹⁴ + x¹² + x¹⁰ + x⁸ + x⁴ + 1
b = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000010101000000000101010100 b = 0x00000000000000000000000000540154 b = x²² + x²⁰ + x¹⁸ + x⁸ + x⁶ + x⁴ + x²
101010001010101010100010001 | 10101000000000101010100 - 10101000000000101010100 | 1 --------------------------- | 1010100000001010001 | - 00000000000000000000000 | 0 - 00000000000000000000000 | 0 - 00000000000000000000000 | 0 - 00000000000000000000000 | 0
c_quotient = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000010000 c_quotient = 0x00000000000000000000000000000010 c_quotient = x⁴
c_remainder = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001010100000001010001 c_remainder = 0x00000000000000000000000000054051 c_remainder = x¹⁸ + x¹⁶ + x¹⁴ + x⁶ + x⁴ + 1