gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000010101000000000101000000000100000100000101
a = 0x0000015005004105
a = x40 + x38 + x36 + x26 + x24 + x14 + x8 + x2 + 1

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

  10101000000000101000000000100000100000101 | 101010001010101000000010100000001
- 101010001010101000000010100000001         | 1
  ----------------------------------------- |
          101010001000001010100000000000101 |
-  000000000000000000000000000000000        | 0
-   000000000000000000000000000000000       | 0
-    000000000000000000000000000000000      | 0
-     000000000000000000000000000000000     | 0
-      000000000000000000000000000000000    | 0
-       000000000000000000000000000000000   | 0
-        000000000000000000000000000000000  | 0
-         101010001010101000000010100000001 | 1
  ----------------------------------------- |
                    10100010100010100000100 |

cquotient = b0000000000000000000000000000000000000000000000000000000100000001
cquotient = 0x0000000000000101
cquotient = x8 + 1

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