gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000101000101000101010100010101010100000000000100010000
a = 0x0005145515500110
a = x50 + x48 + x44 + x42 + x38 + x36 + x34 + x32 + x28 + x26 + x24 + x22 + x20 + x8 + x4

b = b0000000000000001010000010000000000000000010000010001010100000001
b = 0x0001410000411501
b = x48 + x46 + x40 + x22 + x16 + x12 + x10 + x8 + 1

  101000101000101010100010101010100000000000100010000 | 1010000010000000000000000010000010001010100000001
- 1010000010000000000000000010000010001010100000001   | 1
  --------------------------------------------------- |
        100000101010100010100010101000101010100010100 |
-  0000000000000000000000000000000000000000000000000  | 0
-   0000000000000000000000000000000000000000000000000 | 0

cquotient = b0000000000000000000000000000000000000000000000000000000000000100
cquotient = 0x0000000000000004
cquotient = x2

cremainder = b0000000000000000000100000101010100010100010101000101010100010100
cremainder = 0x0000105514545514
cremainder = x44 + x38 + x36 + x34 + x32 + x28 + x26 + x22 + x20 + x18 + x14 + x12 + x10 + x8 + x4 + x2