Recent directions in netlist partitioning: a survey
Integration, the VLSI Journal
Candidate subcircuits for functional module identification in logic circuits
GLSVLSI '00 Proceedings of the 10th Great Lakes symposium on VLSI
Unveiling the ISCAS-85 Benchmarks: A Case Study in Reverse Engineering
IEEE Design & Test
Reverse Engineering and Design Recovery: A Taxonomy
IEEE Software
Watermarking, tamper-proffing, and obfuscation: tools for software protection
IEEE Transactions on Software Engineering
Software issues in digital forensics
ACM SIGOPS Operating Systems Review
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Securing netlist-level FPGA design through exploiting process variation and degradation
Proceedings of the ACM/SIGDA international symposium on Field Programmable Gate Arrays
Deterministic circuit variation for anti-tamper applications
Proceedings of the Seventh Annual Workshop on Cyber Security and Information Intelligence Research
| Hi-index | 0.00 |
A current means to protect intellectual property embedded in both circuits and software involves creating a functionally equivalent variant with subjective qualities related to difficulty of reverse engineering. In this paper, we consider the problem of protection in a smaller, generalized class of programs based on Boolean logic primitives. We consider Boolean logic reduction as one means to quantify hardness of undoing structural transformations designed to impede reverse engineering. We detail our experiences in using both commercial synthesis tools and organic red-team tools that simplify transformations using known basic logic patterns. Using simple component recovery on candidate circuits, we show how specific variation methods impact adversarial analysis and posit relationships between specific transformations and corresponding difficulty of reversal.