gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

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

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

  100010000000000000000000100000000010100000001000000000000000001 | 1010101010101010100000000010100010000010101000100010101010000
- 1010101010101010100000000010100010000010101000100010101010000   | 1
  --------------------------------------------------------------- |
    1000101010101010000000101010001010101010101010001010101000001 |
-  0000000000000000000000000000000000000000000000000000000000000  | 0
-   1010101010101010100000000010100010000010101000100010101010000 | 1
  --------------------------------------------------------------- |
      10000000000000100000101000101000101000000010101000000010001 |

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

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