gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000010000000000000000010101000101000001000101
a = 0x00000000000000000000010000545045
a = x40 + x22 + x20 + x18 + x14 + x12 + x6 + x2 + 1

b = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000100000100010001000101010100000100010001
b = 0x00000000000000000000004111154111
b = x38 + x32 + x28 + x24 + x20 + x18 + x16 + x14 + x8 + x4 + 1

  10000000000000000010101000101000001000101 | 100000100010001000101010100000100010001
- 100000100010001000101010100000100010001   | 1
  ----------------------------------------- |
        10001000100000000010101010000000001 |
-  000000000000000000000000000000000000000  | 0
-   000000000000000000000000000000000000000 | 0

cquotient = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000100
cquotient = 0x00000000000000000000000000000004
cquotient = x2

cremainder = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000010001000100000000010101010000000001
cremainder = 0x00000000000000000000000444015401
cremainder = x34 + x30 + x26 + x16 + x14 + x12 + x10 + 1