gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000000000000000000001000000010100000000
a = 0x0000000000040500
a = x18 + x10 + x8

b = b0000000000000000000000000000000000000000000000000000000100000001
b = 0x0000000000000101
b = x8 + 1

  1000000010100000000 | 100000001
- 100000001           | 1
  ------------------- |
            100000000 |
-  000000000          | 0
-   000000000         | 0
-    000000000        | 0
-     000000000       | 0
-      000000000      | 0
-       000000000     | 0
-        000000000    | 0
-         000000000   | 0
-          000000000  | 0
-           100000001 | 1
  ------------------- |
                    1 |

cquotient = b0000000000000000000000000000000000000000000000000000010000000001
cquotient = 0x0000000000000401
cquotient = x10 + 1

cremainder = b0000000000000000000000000000000000000000000000000000000000000001
cremainder = 0x0000000000000001
cremainder = 1