gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000111101111101100100100100100111111111001100111111
a = 0x0000f7d9249ff33f
a = x47 + x46 + x45 + x44 + x42 + x41 + x40 + x39 + x38 + x36 + x35 + x32 + x29 + x26 + x23 + x20 + x19 + x18 + x17 + x16 + x15 + x14 + x13 + x12 + x9 + x8 + x5 + x4 + x3 + x2 + x + 1

b = b0000000000000000000100011011101100010010111000110111101000001100
b = 0x000011bb12e37a0c
b = x44 + x40 + x39 + x37 + x36 + x35 + x33 + x32 + x28 + x25 + x23 + x22 + x21 + x17 + x16 + x14 + x13 + x12 + x11 + x9 + x3 + x2

  111101111101100100100100100111111111001100111111 | 100011011101100010010111000110111101000001100
- 100011011101100010010111000110111101000001100    | 1
  ------------------------------------------------ |
   11110100000000110110011100001000010001101011111 |
-  100011011101100010010111000110111101000001100   | 1
  ------------------------------------------------ |
    1111001110110111111000000010011100101101101111 |
-   100011011101100010010111000110111101000001100  | 1
  ------------------------------------------------ |
     111111001101111011101110011110011111101110111 |
-    100011011101100010010111000110111101000001100 | 1
  ------------------------------------------------ |
      11100010000011001111001011000100010101111011 |

cquotient = b0000000000000000000000000000000000000000000000000000000000001111
cquotient = 0x000000000000000f
cquotient = x3 + x2 + x + 1

cremainder = b0000000000000000000011100010000011001111001011000100010101111011
cremainder = 0x00000e20cf2c457b
cremainder = x43 + x42 + x41 + x37 + x31 + x30 + x27 + x26 + x25 + x24 + x21 + x19 + x18 + x14 + x10 + x8 + x6 + x5 + x4 + x3 + x + 1