gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000000010000001111001111001101000001100
a = 0x0000000081e79a0c
a = x31 + x24 + x23 + x22 + x21 + x18 + x17 + x16 + x15 + x12 + x11 + x9 + x3 + x2

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

  10000001111001111001101000001100 | 1100100111111101001110010010111
- 1100100111111101001110010010111  | 1
  -------------------------------- |
   1001000000110101010001100100010 |
-  1100100111111101001110010010111 | 1
  -------------------------------- |
    101100111001000011111110110101 |

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

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