gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000000000000000000100010101010001000101
a = 0x0000000000115445
a = x20 + x16 + x14 + x12 + x10 + x6 + x2 + 1

b = b0000000000000000000000000000000000000000000000000000010000010100
b = 0x0000000000000414
b = x10 + x4 + x2

  100010101010001000101 | 10000010100
- 10000010100           | 1
  --------------------- |
      10000010001000101 |
-  00000000000          | 0
-   00000000000         | 0
-    00000000000        | 0
-     10000010100       | 1
  --------------------- |
              101000101 |
-      00000000000      | 0
-       00000000000     | 0
-        00000000000    | 0
-         00000000000   | 0
-          00000000000  | 0
-           00000000000 | 0

cquotient = b0000000000000000000000000000000000000000000000000000010001000000
cquotient = 0x0000000000000440
cquotient = x10 + x6

cremainder = b0000000000000000000000000000000000000000000000000000000101000101
cremainder = 0x0000000000000145
cremainder = x8 + x6 + x2 + 1