gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b00000000000000000000000000000000000000000000000000000000000000000001010101010101010100000000010100010000010101000100010101010000
a = 0x00000000000000001555500510544550
a = x60 + x58 + x56 + x54 + x52 + x50 + x48 + x46 + x44 + x34 + x32 + x28 + x22 + x20 + x18 + x14 + x10 + x8 + x6 + x4

b = b00000000000000000000000000000000000000000000000000000000000000000000010000000000000100000101000101000101000000010101000000010001
b = 0x00000000000000000400105145015011
b = x58 + x44 + x38 + x36 + x32 + x30 + x26 + x24 + x16 + x14 + x12 + x4 + 1

  1010101010101010100000000010100010000010101000100010101010000 | 10000000000000100000101000101000101000000010101000000010001
- 10000000000000100000101000101000101000000010101000000010001   | 1
  ------------------------------------------------------------- |
    10101010101000100010100000000000100010100010000010100010100 |
-  00000000000000000000000000000000000000000000000000000000000  | 0
-   10000000000000100000101000101000101000000010101000000010001 | 1
  ------------------------------------------------------------- |
      101010101000000010001000101000001010100000101010100000101 |

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

cremainder = b00000000000000000000000000000000000000000000000000000000000000000000000101010101000000010001000101000001010100000101010100000101
cremainder = 0x00000000000000000155011141505505
cremainder = x56 + x54 + x52 + x50 + x48 + x40 + x36 + x32 + x30 + x24 + x22 + x20 + x14 + x12 + x10 + x8 + x2 + 1