gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000000101010001010101000000010100000001
a = 0x0000000151540501
a = x32 + x30 + x28 + x24 + x22 + x20 + x18 + x10 + x8 + 1

b = b0000000000000000000000000000000000000000010100010100010100000100
b = 0x0000000000514504
b = x22 + x20 + x16 + x14 + x10 + x8 + x2

  101010001010101000000010100000001 | 10100010100010100000100
- 10100010100010100000100           | 1
  --------------------------------- |
      10100010000000001010100000001 |
-  00000000000000000000000          | 0
-   00000000000000000000000         | 0
-    00000000000000000000000        | 0
-     10100010100010100000100       | 1
  --------------------------------- |
              100010101010000000001 |
-      00000000000000000000000      | 0
-       00000000000000000000000     | 0
-        00000000000000000000000    | 0
-         00000000000000000000000   | 0
-          00000000000000000000000  | 0
-           00000000000000000000000 | 0

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

cremainder = b0000000000000000000000000000000000000000000100010101010000000001
cremainder = 0x0000000000115401
cremainder = x20 + x16 + x14 + x12 + x10 + 1