Finding Algorithmic Bits in a Binary Haystack

Designed and developed a system for finding potential instantiations of any algorithm within a binary executable program. Given a description of an algorithm, the system analyzes compiled binaries to identify code sequences that may implement that algorithm — even when the implementation has been obfuscated, optimized, or compiled from a different source language.

This work was conducted at Johns Hopkins University (January–May 2013) and was presented to the National Security Agency in May 2013.