gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000000000010001010001010001010101010001
a = 0x0000000011451551
a = x28 + x24 + x22 + x18 + x16 + x12 + x10 + x8 + x6 + x4 + 1

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

  10001010001010001010101010001 | 100010101010001000101
- 100010101010001000101         | 1
  ----------------------------- |
          100010101000001010001 |
-  000000000000000000000        | 0
-   000000000000000000000       | 0
-    000000000000000000000      | 0
-     000000000000000000000     | 0
-      000000000000000000000    | 0
-       000000000000000000000   | 0
-        000000000000000000000  | 0
-         100010101010001000101 | 1
  ----------------------------- |
                    10000010100 |

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

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