gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b00000000000000000000000000000001010100010001010000000000010001010000000001000100000000000101010000010101000101010000000100010001
a = 0x00000001511400450044005415150111
a = x96 + x94 + x92 + x88 + x84 + x82 + x70 + x66 + x64 + x54 + x50 + x38 + x36 + x34 + x28 + x26 + x24 + x20 + x18 + x16 + x8 + x4 + 1

b = b00000000000000000000000000000000010101010100010100010001010100010101000101000000000000000101000101010001010101000000000101010101
b = 0x00000000554511515140005151540155
b = x94 + x92 + x90 + x88 + x86 + x82 + x80 + x76 + x72 + x70 + x68 + x64 + x62 + x60 + x56 + x54 + x38 + x36 + x32 + x30 + x28 + x24 + x22 + x20 + x18 + x8 + x6 + x4 + x2 + 1

  1010100010001010000000000010001010000000001000100000000000101010000010101000101010000000100010001 | 10101010100010100010001010100010101000101000000000000000101000101010001010101000000000101010101
- 10101010100010100010001010100010101000101000000000000000101000101010001010101000000000101010101   | 1
  ------------------------------------------------------------------------------------------------- |
        1000000000001000101000000000100010101000100000000010001000101010000010001010000010001000101 |
-  00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000  | 0
-   00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000 | 0

cquotient = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000100
cquotient = 0x00000000000000000000000000000004
cquotient = x2

cremainder = b00000000000000000000000000000000000001000000000001000101000000000100010101000100000000010001000101010000010001010000010001000101
cremainder = 0x00000000040045004544011150450445
cremainder = x90 + x78 + x74 + x72 + x62 + x58 + x56 + x54 + x50 + x40 + x36 + x32 + x30 + x28 + x22 + x18 + x16 + x10 + x6 + x2 + 1