gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000001111100101010001010010110110010011000111
a = 0x000000f9514b64c7
a = x39 + x38 + x37 + x36 + x35 + x32 + x30 + x28 + x24 + x22 + x19 + x17 + x16 + x14 + x13 + x10 + x7 + x6 + x2 + x + 1

b = b0000000000000000000000000100100101010010111010111011111110110101
b = 0x0000004952ebbfb5
b = x38 + x35 + x32 + x30 + x28 + x25 + x23 + x22 + x21 + x19 + x17 + x16 + x15 + x13 + x12 + x11 + x10 + x9 + x8 + x7 + x5 + x4 + x2 + 1

  1111100101010001010010110110010011000111 | 100100101010010111010111011111110110101
- 100100101010010111010111011111110110101  | 1
  ---------------------------------------- |
   110101111110100100111000001101110101101 |
-  100100101010010111010111011111110110101 | 1
  ---------------------------------------- |
    10001010100110011101111010010000011000 |

cquotient = b0000000000000000000000000000000000000000000000000000000000000011
cquotient = 0x0000000000000003
cquotient = x + 1

cremainder = b0000000000000000000000000010001010100110011101111010010000011000
cremainder = 0x00000022a677a418
cremainder = x37 + x33 + x31 + x29 + x26 + x25 + x22 + x21 + x20 + x18 + x17 + x16 + x15 + x13 + x10 + x4 + x3