gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000010001010101010100010101000000010101010100000000000000010001
a = 0x0455515015500011
a = x58 + x54 + x52 + x50 + x48 + x46 + x44 + x40 + x38 + x36 + x28 + x26 + x24 + x22 + x20 + x4 + 1

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

  10001010101010100010101000000010101010100000000000000010001 | 1010001010100000000010001000000000100000000000000000000
- 1010001010100000000010001000000000100000000000000000000     | 1
  ----------------------------------------------------------- |
    101000000010100010001010000010100010100000000000000010001 |
-  0000000000000000000000000000000000000000000000000000000    | 0
-   1010001010100000000010001000000000100000000000000000000   | 1
  ----------------------------------------------------------- |
          101000100010000010100010100000100000000000000010001 |
-    0000000000000000000000000000000000000000000000000000000  | 0
-     0000000000000000000000000000000000000000000000000000000 | 0

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

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