gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000000000010001010000000000000000000000
a = 0x0000000011400000
a = x28 + x24 + x22

b = b0000000000000000000000000000000000000000010101000100010000000101
b = 0x0000000000544405
b = x22 + x20 + x18 + x14 + x10 + x2 + 1

  10001010000000000000000000000 | 10101000100010000000101
- 10101000100010000000101       | 1
  ----------------------------- |
    100010100010000000101000000 |
-  00000000000000000000000      | 0
-   10101000100010000000101     | 1
  ----------------------------- |
      1000101010100000100010000 |
-    00000000000000000000000    | 0
-     10101000100010000000101   | 1
  ----------------------------- |
        10001000101000100000100 |
-      00000000000000000000000  | 0
-       10101000100010000000101 | 1
  ----------------------------- |
          100000001010100000001 |

cquotient = b0000000000000000000000000000000000000000000000000000000001010101
cquotient = 0x0000000000000055
cquotient = x6 + x4 + x2 + 1

cremainder = b0000000000000000000000000000000000000000000100000001010100000001
cremainder = 0x0000000000101501
cremainder = x20 + x12 + x10 + x8 + 1