gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000000001000101010101000100010000000101 a = 0x0000000045544405 a = x³⁰ + x²⁶ + x²⁴ + x²² + x²⁰ + x¹⁸ + x¹⁴ + x¹⁰ + x² + 1
b = b0000000000000000000000000000000000010001010000000000000000000000 b = 0x0000000011400000 b = x²⁸ + x²⁴ + x²²
1000101010101000100010000000101 | 10001010000000000000000000000 - 10001010000000000000000000000 | 1 ------------------------------- | 10101000100010000000101 | - 00000000000000000000000000000 | 0 - 00000000000000000000000000000 | 0
c_quotient = b0000000000000000000000000000000000000000000000000000000000000100 c_quotient = 0x0000000000000004 c_quotient = x²
c_remainder = b0000000000000000000000000000000000000000010101000100010000000101 c_remainder = 0x0000000000544405 c_remainder = x²² + x²⁰ + x¹⁸ + x¹⁴ + x¹⁰ + x² + 1