gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000001000100000100010000010001000000000000000101 a = 0x00000000000000000000044110440005 a = x⁴² + x³⁸ + x³² + x²⁸ + x²² + x¹⁸ + x² + 1
b = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000010000000000000000010101000101000001000101 b = 0x00000000000000000000010000545045 b = x⁴⁰ + x²² + x²⁰ + x¹⁸ + x¹⁴ + x¹² + x⁶ + x² + 1
1000100000100010000010001000000000000000101 | 10000000000000000010101000101000001000101 - 10000000000000000010101000101000001000101 | 1 ------------------------------------------- | 100000100010001000101010100000100010001 | - 00000000000000000000000000000000000000000 | 0 - 00000000000000000000000000000000000000000 | 0
c_quotient = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000100 c_quotient = 0x00000000000000000000000000000004 c_quotient = x²
c_remainder = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000100000100010001000101010100000100010001 c_remainder = 0x00000000000000000000004111154111 c_remainder = x³⁸ + x³² + x²⁸ + x²⁴ + x²⁰ + x¹⁸ + x¹⁶ + x¹⁴ + x⁸ + x⁴ + 1