-
-
Notifications
You must be signed in to change notification settings - Fork 2.9k
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
De Bruijn sequences #900
Comments
Could you provide a C-based implementation of it? That dbrujin algo seems to be bit-based, and we need byte-based patterns. how to use this in metasploit? On 08 May 2014, at 22:34, jvoisin notifications@github.com wrote:
|
It is used both in metasploit and in mona.py to find the right offset to gain control of EIP. Here is an article about this usage. |
I've implemented the De Bruijn sequence in C, in the same way that it is done in in PEDA, also for lookups to find the offsets. I'll try to incorperate it in radare's style and add it! :-) https://gist.github.com/crowell/77b601db16562ac49834/1bdaeda74724ea9497512c9b2db5c32565b779bf |
Should this be closed due to #1272? |
Indeed :) |
It might also need to be checked off in the Mona.py and PEDA issues as done. |
Wrong path separators have been used. The fix makes them consistent and correspond the Operating System.
It would be super cool to have cyclic patterns support in radare2 for exploits development, like in Metasploit. Here is an implementation in Python.
The text was updated successfully, but these errors were encountered: