gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000000000101100111001000011111110110101
a = 0x000000002ce43fb5
a = x29 + x27 + x26 + x23 + x22 + x21 + x18 + x13 + x12 + x11 + x10 + x9 + x8 + x7 + x5 + x4 + x2 + 1

b = b0000000000000000000000000000000000010001110100101101110001001000
b = 0x0000000011d2dc48
b = x28 + x24 + x23 + x22 + x20 + x17 + x15 + x14 + x12 + x11 + x10 + x6 + x3

  101100111001000011111110110101 | 10001110100101101110001001000
- 10001110100101101110001001000  | 1
  ------------------------------ |
    1111010000011000011100100101 |
-  00000000000000000000000000000 | 0

cquotient = b0000000000000000000000000000000000000000000000000000000000000010
cquotient = 0x0000000000000002
cquotient = x

cremainder = b0000000000000000000000000000000000001111010000011000011100100101
cremainder = 0x000000000f418725
cremainder = x27 + x26 + x25 + x24 + x22 + x16 + x15 + x10 + x9 + x8 + x5 + x2 + 1