gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000010001011001011101101101010110001011000000000
a = 0x000008b2edab1600
a = x43 + x39 + x37 + x36 + x33 + x31 + x30 + x29 + x27 + x26 + x24 + x23 + x21 + x19 + x17 + x16 + x12 + x10 + x9

b = b0000000000000000000000100111110000010011001001110100000100111111
b = 0x0000027c1327413f
b = x41 + x38 + x37 + x36 + x35 + x34 + x28 + x25 + x24 + x21 + x18 + x17 + x16 + x14 + x8 + x5 + x4 + x3 + x2 + x + 1

  10001011001011101101101010110001011000000000 | 100111110000010011001001110100000100111111
- 100111110000010011001001110100000100111111   | 1
  -------------------------------------------- |
     10100001010100001001101100001001011111100 |
-  000000000000000000000000000000000000000000  | 0
-   000000000000000000000000000000000000000000 | 0

cquotient = b0000000000000000000000000000000000000000000000000000000000000100
cquotient = 0x0000000000000004
cquotient = x2

cremainder = b0000000000000000000000010100001010100001001101100001001011111100
cremainder = 0x00000142a13612fc
cremainder = x40 + x38 + x33 + x31 + x29 + x24 + x21 + x20 + x18 + x17 + x12 + x9 + x7 + x6 + x5 + x4 + x3 + x2