gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b00000000000000000000000000000000000000000000000000000000000101010001000000000000010001010101000000000100010000000001000000000100
a = 0x00000000000000151000455004401004
a = x68 + x66 + x64 + x60 + x46 + x42 + x40 + x38 + x36 + x26 + x22 + x12 + x2

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

  101010001000000000000010001010101000000000100010000000001000000000100 | 10100000101010101010100010100010101010100010000000100010101010101
- 10100000101010101010100010100010101010100010000000100010101010101     | 1
  --------------------------------------------------------------------- |
      10000010101010101010100010000010101000000010001000100010101010100 |
-  00000000000000000000000000000000000000000000000000000000000000000    | 0
-   00000000000000000000000000000000000000000000000000000000000000000   | 0
-    00000000000000000000000000000000000000000000000000000000000000000  | 0
-     10100000101010101010100010100010101010100010000000100010101010101 | 1
  --------------------------------------------------------------------- |
        100010000000000000000000100000000010100000001000000000000000001 |

cquotient = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000010001
cquotient = 0x00000000000000000000000000000011
cquotient = x4 + 1

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