gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b00000000000000000000000000000000000000000000000000000000000000010100000101010101010100010100010101010100010000000100010101010101
a = 0x00000000000000014155514554404555
a = x64 + x62 + x56 + x54 + x52 + x50 + x48 + x46 + x44 + x40 + x38 + x34 + x32 + x30 + x28 + x26 + x22 + x14 + x10 + x8 + x6 + x4 + x2 + 1

b = b00000000000000000000000000000000000000000000000000000000000000000100010000000000000000000100000000010100000001000000000000000001
b = 0x00000000000000004400004014040001
b = x62 + x58 + x38 + x28 + x26 + x18 + 1

  10100000101010101010100010100010101010100010000000100010101010101 | 100010000000000000000000100000000010100000001000000000000000001
- 100010000000000000000000100000000010100000001000000000000000001   | 1
  ----------------------------------------------------------------- |
    101000101010101010100000100010100000100010100000100010101010001 |
-  000000000000000000000000000000000000000000000000000000000000000  | 0
-   100010000000000000000000100000000010100000001000000000000000001 | 1
  ----------------------------------------------------------------- |
      1010101010101010100000000010100010000010101000100010101010000 |

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

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