gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000100000100000100000001010101000100010101 a = 0x0000004104055115 a = x³⁸ + x³² + x²⁶ + x¹⁸ + x¹⁶ + x¹⁴ + x¹² + x⁸ + x⁴ + x² + 1
b = b0000000000000000000000000000010101010100000001010001000101010000 b = 0x0000000554051150 b = x³⁴ + x³² + x³⁰ + x²⁸ + x²⁶ + x¹⁸ + x¹⁶ + x¹² + x⁸ + x⁶ + x⁴
100000100000100000001010101000100010101 | 10101010100000001010001000101010000 - 10101010100000001010001000101010000 | 1 --------------------------------------- | 1010001000100010101000100010000010101 | - 00000000000000000000000000000000000 | 0 - 10101010100000001010001000101010000 | 1 --------------------------------------- | 100010100010000000000000101010101 | - 00000000000000000000000000000000000 | 0 - 00000000000000000000000000000000000 | 0
c_quotient = b0000000000000000000000000000000000000000000000000000000000010100 c_quotient = 0x0000000000000014 c_quotient = x⁴ + x²
c_remainder = b0000000000000000000000000000000100010100010000000000000101010101 c_remainder = 0x0000000114400155 c_remainder = x³² + x²⁸ + x²⁶ + x²² + x⁸ + x⁶ + x⁴ + x² + 1