gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000010110000110011010100001110000011010111111000011111
a = 0x0002c3350e0d7e1f
a = 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

b = b0000000000000000010010101110100001001001101010101101110011111001
b = 0x00004ae849aadcf9
b = x46 + x43 + x41 + x39 + x38 + x37 + x35 + x30 + x27 + x24 + x23 + x21 + x19 + x17 + x15 + x14 + x12 + x11 + x10 + x7 + x6 + x5 + x4 + x3 + 1

  10110000110011010100001110000011010111111000011111 | 10010101110100001001001101010101101110011111001
- 10010101110100001001001101010101101110011111001    | 1
  -------------------------------------------------- |
    100101000111011101000011010110111001100111010111 |
-  00000000000000000000000000000000000000000000000   | 0
-   10010101110100001001001101010101101110011111001  | 1
  -------------------------------------------------- |
           11010011111010000000011100010000000100101 |
-    00000000000000000000000000000000000000000000000 | 0

cquotient = b0000000000000000000000000000000000000000000000000000000000001010
cquotient = 0x000000000000000a
cquotient = x3 + x

cremainder = b0000000000000000000000011010011111010000000011100010000000100101
cremainder = 0x000001a7d00e2025
cremainder = x40 + x39 + x37 + x34 + x33 + x32 + x31 + x30 + x28 + x19 + x18 + x17 + x13 + x5 + x2 + 1