gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000011011111100011010010110001010000011
a = 0x00000006fc696283
a = x34 + x33 + x31 + x30 + x29 + x28 + x27 + x26 + x22 + x21 + x19 + x16 + x14 + x13 + x9 + x7 + x + 1

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

  11011111100011010010110001010000011 | 111100110110101100011001010000011
- 111100110110101100011001010000011   | 1
  ----------------------------------- |
    101100111001100011010100010001111 |
-  000000000000000000000000000000000  | 0
-   111100110110101100011001010000011 | 1
  ----------------------------------- |
     10000001111001111001101000001100 |

cquotient = b0000000000000000000000000000000000000000000000000000000000000101
cquotient = 0x0000000000000005
cquotient = x2 + 1

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