Show HN: Obfuscation Tool for Mixed Boolean Arithmetic Expressions(github.com)
github.com
Show HN: Obfuscation Tool for Mixed Boolean Arithmetic Expressions
https://github.com/seekbytes/pocket
3 comments
Since you're not increasing the number of variables, it seems to me that the problem of finding the initial Boolean formula (or an even simpler version of it) is fairly straightforward. Have you done any tests along these lines?
Yeah, even LLVM is able to decode part of the obfuscated expression. Sometimes, it fails greatly printing out the obfuscated expression. There're several papers available and I'll write about it.
Example of output: https://github.com/seekbytes/pocket#example
Mixed Boolean Arithmetic refers to expressions which include boolean, and arithmetic operations (AND, OR, XOR, PLUS, MINUS, MULTIPLY..). Let an expression be something like A + B. My tool applies some transformations to re-write this expression in more complex terms (such as ((A & B) + (A | B))).
Let me know if you have any questions!
Mixed Boolean Arithmetic refers to expressions which include boolean, and arithmetic operations (AND, OR, XOR, PLUS, MINUS, MULTIPLY..). Let an expression be something like A + B. My tool applies some transformations to re-write this expression in more complex terms (such as ((A & B) + (A | B))).
Let me know if you have any questions!