gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000000000000000010101000100010000000101 a = 0x0000000000544405 a = x²² + x²⁰ + x¹⁸ + x¹⁴ + x¹⁰ + x² + 1
b = b0000000000000000000000000000000000000000000100000001010100000001 b = 0x0000000000101501 b = x²⁰ + x¹² + x¹⁰ + x⁸ + 1
10101000100010000000101 | 100000001010100000001 - 100000001010100000001 | 1 ----------------------- | 101000001000000000001 | - 000000000000000000000 | 0 - 100000001010100000001 | 1 ----------------------- | 1000000010100000000 |
c_quotient = b0000000000000000000000000000000000000000000000000000000000000101 c_quotient = 0x0000000000000005 c_quotient = x² + 1
c_remainder = b0000000000000000000000000000000000000000000001000000010100000000 c_remainder = 0x0000000000040500 c_remainder = x¹⁸ + x¹⁰ + x⁸