gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b00000000000000000000000000000000000000000000000000000000010101010000000101010100010001000000010101000101010000000000010101000101
a = 0x00000000000000550154440545400545
a = x70 + x68 + x66 + x64 + x56 + x54 + x52 + x50 + x46 + x42 + x34 + x32 + x30 + x26 + x24 + x22 + x10 + x8 + x6 + x2 + 1

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

  10101010000000101010100010001000000010101000101010000000000010101000101 | 101010001000000000000010001010101000000000100010000000001000000000100
- 101010001000000000000010001010101000000000100010000000001000000000100   | 1
  ----------------------------------------------------------------------- |
        10100000101010101010100010100010101010100010000000100010101010101 |
-  000000000000000000000000000000000000000000000000000000000000000000000  | 0
-   000000000000000000000000000000000000000000000000000000000000000000000 | 0

cquotient = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000100
cquotient = 0x00000000000000000000000000000004
cquotient = x2

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