gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0001000100010001010100010000000000000001000000000100010101010001
a = 0x1111510001004551
a = x60 + x56 + x52 + x48 + x46 + x44 + x40 + x24 + x14 + x10 + x8 + x6 + x4 + 1

b = b0000000000010000000001000000000101000000010100010001000001010001
b = 0x0010040140511051
b = x52 + x42 + x32 + x30 + x22 + x20 + x16 + x12 + x6 + x4 + 1

  1000100010001010100010000000000000001000000000100010101010001 | 10000000001000000000101000000010100010001000001010001
- 10000000001000000000101000000010100010001000001010001         | 1
  ------------------------------------------------------------- |
      100010101010100000100000001010000000100000001010001010001 |
-  00000000000000000000000000000000000000000000000000000        | 0
-   00000000000000000000000000000000000000000000000000000       | 0
-    00000000000000000000000000000000000000000000000000000      | 0
-     10000000001000000000101000000010100010001000001010001     | 1
  ------------------------------------------------------------- |
          10101000100000101010001010101000000010001000101000001 |
-      00000000000000000000000000000000000000000000000000000    | 0
-       00000000000000000000000000000000000000000000000000000   | 0
-        00000000000000000000000000000000000000000000000000000  | 0
-         10000000001000000000101000000010100010001000001010001 | 1
  ------------------------------------------------------------- |
            101000101000101010100010101010100000000000100010000 |

cquotient = b0000000000000000000000000000000000000000000000000000000100010001
cquotient = 0x0000000000000111
cquotient = x8 + x4 + 1

cremainder = b0000000000000101000101000101010100010101010100000000000100010000
cremainder = 0x0005145515500110
cremainder = x50 + x48 + x44 + x42 + x38 + x36 + x34 + x32 + x28 + x26 + x24 + x22 + x20 + x8 + x4