gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000000111100110110101100011001010000011
a = 0x00000001e6d63283
a = x32 + x31 + x30 + x29 + x26 + x25 + x23 + x22 + x20 + x18 + x17 + x13 + x12 + x9 + x7 + x + 1

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

  111100110110101100011001010000011 | 10000001111001111001101000001100
- 10000001111001111001101000001100  | 1
  --------------------------------- |
   11100101000110010000011010011011 |
-  10000001111001111001101000001100 | 1
  --------------------------------- |
    1100100111111101001110010010111 |

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

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