gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000000001100100111111101001110010010111
a = 0x0000000064fe9c97
a = x30 + x29 + x26 + x23 + x22 + x21 + x20 + x19 + x18 + x17 + x15 + x12 + x11 + x10 + x7 + x4 + x2 + x + 1

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

  1100100111111101001110010010111 | 101100111001000011111110110101
- 101100111001000011111110110101  | 1
  ------------------------------- |
   111101001101101110001111111101 |
-  101100111001000011111110110101 | 1
  ------------------------------- |
    10001110100101101110001001000 |

cquotient = b0000000000000000000000000000000000000000000000000000000000000011
cquotient = 0x0000000000000003
cquotient = x + 1

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