gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b00000000000000000000000000000000000000000000000001010100010001000000010100010101010001000101000001010100000001000001000000010001
a = 0x00000000000054440515445054041011
a = x78 + x76 + x74 + x70 + x66 + x58 + x56 + x52 + x50 + x48 + x46 + x42 + x38 + x36 + x30 + x28 + x26 + x18 + x12 + x4 + 1

b = b00000000000000000000000000000000000000000000000000010000000100010000000100000000000100000100000001010000010000010100000001000101
b = 0x00000000000010110100104050414045
b = x76 + x68 + x64 + x56 + x44 + x38 + x30 + x28 + x22 + x16 + x14 + x6 + x2 + 1

  1010100010001000000010100010101010001000101000001010100000001000001000000010001 | 10000000100010000000100000000000100000100000001010000010000010100000001000101
- 10000000100010000000100000000000100000100000001010000010000010100000001000101   | 1
  ------------------------------------------------------------------------------- |
    10100000000000000000100010101000001010101000100010101000000010001000100000101 |
-  00000000000000000000000000000000000000000000000000000000000000000000000000000  | 0
-   10000000100010000000100000000000100000100000001010000010000010100000001000101 | 1
  ------------------------------------------------------------------------------- |
      100000100010000000000010101000101010001000101000101010000000101000101000000 |

cquotient = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000101
cquotient = 0x00000000000000000000000000000005
cquotient = x2 + 1

cremainder = b00000000000000000000000000000000000000000000000000000100000100010000000000010101000101010001000101000101010000000101000101000000
cremainder = 0x00000000000004110015151145405140
cremainder = x74 + x68 + x64 + x52 + x50 + x48 + x44 + x42 + x40 + x36 + x32 + x30 + x26 + x24 + x22 + x14 + x12 + x8 + x6