gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b00000000000000000000000000000000000000000000000000000000000000000000000000000001000101010000010100000001000100000101000100000000
a = 0x00000000000000000001150501105100
a = x48 + x44 + x42 + x40 + x34 + x32 + x24 + x20 + x14 + x12 + x8

b = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000001000100000100010000010001000000000000000101
b = 0x00000000000000000000044110440005
b = x42 + x38 + x32 + x28 + x22 + x18 + x2 + 1

  1000101010000010100000001000100000101000100000000 | 1000100000100010000010001000000000000000101
- 1000100000100010000010001000000000000000101       | 1
  ------------------------------------------------- |
        1010100000100010000000100000101000001000000 |
-  0000000000000000000000000000000000000000000      | 0
-   0000000000000000000000000000000000000000000     | 0
-    0000000000000000000000000000000000000000000    | 0
-     0000000000000000000000000000000000000000000   | 0
-      0000000000000000000000000000000000000000000  | 0
-       1000100000100010000010001000000000000000101 | 1
  ------------------------------------------------- |
          10000000000000000010101000101000001000101 |

cquotient = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001000001
cquotient = 0x00000000000000000000000000000041
cquotient = x6 + 1

cremainder = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000010000000000000000010101000101000001000101
cremainder = 0x00000000000000000000010000545045
cremainder = x40 + x22 + x20 + x18 + x14 + x12 + x6 + x2 + 1