gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b00000000000000000000000000010000010100010001000001000000010001000100000000010100000001010000000001010101010000010001000100010001
a = 0x00000010511040444014050055411111
a = x100 + x94 + x92 + x88 + x84 + x78 + x70 + x66 + x62 + x52 + x50 + x42 + x40 + x30 + x28 + x26 + x24 + x22 + x16 + x12 + x8 + x4 + 1

b = b00000000000000000000000000000100010000000000000100010000000000000101000000010100000000010101010100010000000101010000010000000000
b = 0x00000004400110005014015510150400
b = x98 + x94 + x80 + x76 + x62 + x60 + x52 + x50 + x40 + x38 + x36 + x34 + x32 + x28 + x20 + x18 + x16 + x10

  10000010100010001000001000000010001000100000000010100000001010000000001010101010000010001000100010001 | 100010000000000000100010000000000000101000000010100000000010101010100010000000101010000010000000000
- 100010000000000000100010000000000000101000000010100000000010101010100010000000101010000010000000000   | 1
  ----------------------------------------------------------------------------------------------------- |
      1010100010001010000000000010001010000000001000100000000000101010000010101000101010000000100010001 |
-  000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000  | 0
-   000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000 | 0

cquotient = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000100
cquotient = 0x00000000000000000000000000000004
cquotient = x2

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