gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

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

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

  10000000100010000000100000000000100000100000001010000010000010100000001000101 | 100000100010000000000010101000101010001000101000101010000000101000101000000
- 100000100010000000000010101000101010001000101000101010000000101000101000000   | 1
  ----------------------------------------------------------------------------- |
        10101010000000101010100010001000000010101000101010000000000010101000101 |
-  000000000000000000000000000000000000000000000000000000000000000000000000000  | 0
-   000000000000000000000000000000000000000000000000000000000000000000000000000 | 0

cquotient = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000100
cquotient = 0x00000000000000000000000000000004
cquotient = x2

cremainder = b00000000000000000000000000000000000000000000000000000000010101010000000101010100010001000000010101000101010000000000010101000101
cremainder = 0x00000000000000550154440545400545
cremainder = x70 + x68 + x66 + x64 + x56 + x54 + x52 + x50 + x46 + x42 + x34 + x32 + x30 + x26 + x24 + x22 + x10 + x8 + x6 + x2 + 1