gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000001010001010100000000010001000000000100000000000000000000
a = 0x0051500440100000
a = x54 + x52 + x48 + x46 + x44 + x34 + x30 + x20

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

  1010001010100000000010001000000000100000000000000000000 | 101000100010000010100010100000100000000000000010001
- 101000100010000010100010100000100000000000000010001     | 1
  ------------------------------------------------------- |
          10000000101010100000001000100000000000100010000 |
-  000000000000000000000000000000000000000000000000000    | 0
-   000000000000000000000000000000000000000000000000000   | 0
-    000000000000000000000000000000000000000000000000000  | 0
-     000000000000000000000000000000000000000000000000000 | 0

cquotient = b0000000000000000000000000000000000000000000000000000000000010000
cquotient = 0x0000000000000010
cquotient = x4

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