gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000010111111011010011000110001100001111111110011000010111
a = 0x0017ed318c3fe617
a = x52 + x50 + x49 + x48 + x47 + x46 + x45 + x43 + x42 + x40 + x37 + x36 + x32 + x31 + x27 + x26 + x21 + x20 + x19 + x18 + x17 + x16 + x15 + x14 + x13 + x10 + x9 + x4 + x2 + x + 1

b = b0000000000000111000011111011011101011011101111010101111011011000
b = 0x00070fb75bbd5ed8
b = x50 + x49 + x48 + x43 + x42 + x41 + x40 + x39 + x37 + x36 + x34 + x33 + x32 + x30 + x28 + x27 + x25 + x24 + x23 + x21 + x20 + x19 + x18 + x16 + x14 + x12 + x11 + x10 + x9 + x7 + x6 + x4 + x3

  10111111011010011000110001100001111111110011000010111 | 111000011111011011101011011101111010101111011011000
- 111000011111011011101011011101111010101111011011000   | 1
  ----------------------------------------------------- |
   1011110100111110110011100010110010101001110101110111 |
-  111000011111011011101011011101111010101111011011000  | 1
  ----------------------------------------------------- |
    101110011001000001001010101101100000010000011000111 |
-   111000011111011011101011011101111010101111011011000 | 1
  ----------------------------------------------------- |
     10110000110011010100001110000011010111111000011111 |

cquotient = b0000000000000000000000000000000000000000000000000000000000000111
cquotient = 0x0000000000000007
cquotient = x2 + x + 1

cremainder = b0000000000000010110000110011010100001110000011010111111000011111
cremainder = 0x0002c3350e0d7e1f
cremainder = x49 + x47 + x46 + x41 + x40 + x37 + x36 + x34 + x32 + x27 + x26 + x25 + x19 + x18 + x16 + x14 + x13 + x12 + x11 + x10 + x9 + x4 + x3 + x2 + x + 1