Protecting Reprogrammable Hardware with Polymorphic Circuit Variation ∗

Cyperspace is constantly threatened by attackers and malware that focus their attacks on a set of known vulnerabilities. When a sequence of software code or hardware structure is exposed, it can reveal new vulnerabilities and weaken embedded protections. Attacks on existing code sequences or hardware structure will be less effective if we can provide sufficient protection. Though software protection is an open problem with known theoretical limits, practitioners seek to find ways of expressing time or cost metrics induced by various techniques on malicious reverse engineers and adversarial analysis. In this paper we consider the nature of circuit transformation algorithms that operate on programmatic logic using iterative sequences of probabilistic and deterministic transforms. We consider such algorithms from the perspective of the kinds of information relative to circuits we are interested in hiding or protecting and experimental results along those lines.

[1]  John P. Hayes,et al.  Unveiling the ISCAS-85 Benchmarks: A Case Study in Reverse Engineering , 1999, IEEE Des. Test Comput..

[2]  Roberto Giacobazzi,et al.  Semantic-Based Code Obfuscation by Abstract Interpretation , 2005, ICALP.

[3]  Patrick Cousot Constructive design of a hierarchy of semantics of a transition system by abstract interpretation , 2002, Theor. Comput. Sci..

[4]  Andrew Walenstein,et al.  Statistical signatures for fast filtering of instruction-substituting metamorphic malware , 2007, WORM '07.

[5]  Guy N. Rothblum,et al.  On Best-Possible Obfuscation , 2007, TCC.

[6]  Yuval Ishai,et al.  Private Circuits: Securing Hardware against Probing Attacks , 2003, CRYPTO.

[7]  A. Benjamin Premkumar,et al.  Private stateful circuits secure against probing attacks , 2007, ASIACCS '07.

[8]  Frederick B. Cohen,et al.  Operating system protection through program evolution , 1993, Comput. Secur..

[9]  Alec Yasinsac,et al.  Of unicorns and random programs , 2005, Communications and Computer Networks.

[10]  Alec Yasinsac,et al.  Applications for Provably Secure Intent Protection with Bounded Input-Size Programs , 2007, The Second International Conference on Availability, Reliability and Security (ARES'07).

[11]  A. Benjamin Premkumar,et al.  Hiding Circuit Topology from Unbounded Reverse Engineers , 2006, ACISP.

[12]  Ingrid Verbauwhede,et al.  Design method for constant power consumption of differential logic circuits , 2005, Design, Automation and Test in Europe.

[13]  Valentin Goranko,et al.  Logic in Computer Science: Modelling and Reasoning About Systems , 2007, J. Log. Lang. Inf..

[14]  Alec Yasinsac,et al.  Software issues in digital forensics , 2008, OPSR.

[15]  Christian S. Collberg,et al.  Watermarking, Tamper-Proofing, and Obfuscation-Tools for Software Protection , 2002, IEEE Trans. Software Eng..

[16]  Andrew Walenstein,et al.  Normalizing Metamorphic Malware Using Term Rewriting , 2006, 2006 Sixth IEEE International Workshop on Source Code Analysis and Manipulation.

[17]  Alec Yasinsac,et al.  Tamper Resistant Software Through Intent Protection , 2008, Int. J. Netw. Secur..

[18]  Christian F. Tschudin,et al.  On Software Protection via Function Hiding , 1998, Information Hiding.