gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000101000100010000010100010100000100000000000000010001
a = 0x0005110514100011
a = x50 + x48 + x44 + x40 + x34 + x32 + x28 + x26 + x20 + x4 + 1

b = b0000000000000000010000000101010100000001000100000000000100010000
b = 0x0000405501100110
b = x46 + x38 + x36 + x34 + x32 + x24 + x20 + x8 + x4

  101000100010000010100010100000100000000000000010001 | 10000000101010100000001000100000000000100010000
- 10000000101010100000001000100000000000100010000     | 1
  --------------------------------------------------- |
    1000101000101010100000101000100000001000100010001 |
-  00000000000000000000000000000000000000000000000    | 0
-   10000000101010100000001000100000000000100010000   | 1
  --------------------------------------------------- |
        101010000000100000001010100000001010101010001 |
-    00000000000000000000000000000000000000000000000  | 0
-     00000000000000000000000000000000000000000000000 | 0

cquotient = b0000000000000000000000000000000000000000000000000000000000010100
cquotient = 0x0000000000000014
cquotient = x4 + x2

cremainder = b0000000000000000000101010000000100000001010100000001010101010001
cremainder = 0x0000150101501551
cremainder = x44 + x42 + x40 + x32 + x24 + x22 + x20 + x12 + x10 + x8 + x6 + x4 + 1