Peter Meerwald-Stadler
@pmeerw
@[email protected]
The slides from our @reconmtl talk, "Breaking Mixed Boolean-Arithmetic Obfuscation in Real-World Applications" (CC @nicolodev), are now online! Slides: synthesis.to/presentations/… Plugin: github.com/mrphrazer/obfu…
Object to Meta using your data for AI, time's running out facebook.com/help/contact/7… help.instagram.com/contact/767264…
This ‼️🫢
There is no performance degradation due to DRM. Even on lower-end systems, you can enjoy the game in beautiful quality!
📢Xyntia 0.2.0 is now available 📢 You are a reverse engineer, and you need to simplify highly obfuscated expressions (e.g., MBA)? Try Xyntia 0.2.0, the black-box deobfuscator: github.com/binsec/xyntia It includes many new features!
the first time I blocked a person in online communication: bye @elonmusk and that's for 30+ years; in Fidonet times we had a "twit filter"
Oh lord, they published it 🤦♂️ ieeexplore.ieee.org/stamp/stamp.js… If you look at the ten "2048-bit factorizations" in appendix S1, the distance p-q between the factors is either 2 (a prime pair) or 6. You just compute square root of n and guess one bit -- the complexity is literally 2^1.