gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000001010000010100010100010101010001000000010001
a = 0x0000050514551011
a = x42 + x40 + x34 + x32 + x28 + x26 + x22 + x20 + x18 + x16 + x12 + x4 + 1

b = b0000000000000000000000010100010001010001010101010000010101000001
b = 0x0000014451550541
b = x40 + x38 + x34 + x30 + x28 + x24 + x22 + x20 + x18 + x16 + x10 + x8 + x6 + 1

  1010000010100010100010101010001000000010001 | 10100010001010001010101010000010101000001
- 10100010001010001010101010000010101000001   | 1
  ------------------------------------------- |
        1010001010001000000010000010100010101 |
-  00000000000000000000000000000000000000000  | 0
-   00000000000000000000000000000000000000000 | 0

cquotient = b0000000000000000000000000000000000000000000000000000000000000100
cquotient = 0x0000000000000004
cquotient = x2

cremainder = b0000000000000000000000000001010001010001000000010000010100010101
cremainder = 0x0000001451010515
cremainder = x36 + x34 + x30 + x28 + x24 + x16 + x10 + x8 + x4 + x2 + 1