aaaaaa aaaaaaa
2048bdb6e1
simplify _loop so that the "prologe" is shorter and the jump is back into
|
vor 6 Jahren | |
|---|---|---|
| .. | ||
| README.md | vor 6 Jahren | |
| advanced_instructions.asm | vor 6 Jahren | |
| advanced_instructions.h | vor 6 Jahren | |
| assemble.ps1 | vor 6 Jahren | |
| backwards.asm | vor 6 Jahren | |
| backwards.h | vor 6 Jahren | |
| catch.hpp | vor 6 Jahren | |
| export.def | vor 6 Jahren | |
| main.cpp | vor 6 Jahren | |
| simple_tests.asm | vor 6 Jahren | |
| simple_tests.h | vor 6 Jahren | |
| test_cases.h | vor 6 Jahren | |
| test_cases.vcxproj | vor 6 Jahren | |
| test_cases.vcxproj.filters | vor 6 Jahren | |
README.md
Introduction
This project aims to give a simple overview on how good various x64 hooking engines (on windows) are. I’ll try to write various functions, that are hard to patch and then see how each hooking engine does.
I’ll test:
(I’d like to test detours, but I’m not willing to pay for it. So that isn’t tested :( )
There are multiple things that make hooking difficult. Maybe you want to patch while the application is running -- in that case you might get race conditions, as the application is executing your half finished hook. Maybe the software has some self protection features (or other software on the system provides that, e.g. Trustee Rapport)
Evaluating how the hooking engines stack up against that is not the goal here. Neither are non-functional criteria, like how fast it is or how much memory it needs for each hook. This is just about the challenges the function to be hooked itself poses.
Namely:
- Are jumps relocated?
- What about RIP adressing?
- If there’s a loop at the beginning / if it’s a tail recurisve function, does the hooking engine handle it?
- How good is the dissassembler, how many instructions does it know?
- Can it hook already hooked functions?
Test cases ==========