kirancodes.me
To Proof Maintenance & Beyond!

Similarity of binaries through re-optimization

Yaniv David, Nimrod Partush, Eran Yahav

Abstract

We present a scalable approach for establishing similarity between stripped binaries (with no debug information). The main challenge in binary similarity, is to establish similarity even when the code has been compiled using different compilers, with different optimization levels, or targeting different architectures. Overcoming this challenge, while avoiding false positives, is invaluable to the process of reverse engineering and the process of locating vulnerable code.

Related papers