gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000010000000001000000000000000001 a = 0x00000000000000000000000010040001 a = x²⁸ + x¹⁸ + 1
b = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000101010001010101010100010001 b = 0x00000000000000000000000005455511 b = x²⁶ + x²⁴ + x²² + x¹⁸ + x¹⁶ + x¹⁴ + x¹² + x¹⁰ + x⁸ + x⁴ + 1
10000000001000000000000000001 | 101010001010101010100010001 - 101010001010101010100010001 | 1 ----------------------------- | 101000100010101010001000101 | - 000000000000000000000000000 | 0 - 101010001010101010100010001 | 1 ----------------------------- | 10101000000000101010100 |
c_quotient = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000101 c_quotient = 0x00000000000000000000000000000005 c_quotient = x² + 1
c_remainder = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000010101000000000101010100 c_remainder = 0x00000000000000000000000000540154 c_remainder = x²² + x²⁰ + x¹⁸ + x⁸ + x⁶ + x⁴ + x²