Investigate more performant algorithms #2
Description
Currently i believe i only implement some brute forcing algorithm.
There are multiple ways to implement a more performant solution than that:
- SIMD, can probably be applicable to other algorithms as well
- Boyer-Moore Algorithm might be useful, as it is heuristic's based but quite a bit more complex to implement
- Aho-Corasick Algorithm could also be beneficial.
To all of those, maybe it's also beneficial to allow an iterate to all the possible regions of a process, including dynamically loaded libraries.