Unveiling the ISCAS-85 benchmarks: a case study in reverse engineering

Hansen, Mark C.; Yalcin, Hakan; Hayes, John P.

doi:10.1109/54.785838

Cited by 381 publications

(163 citation statements)

References 10 publications

Supporting

Mentioning

161

Contrasting

Unclassified

Order By: Relevance

“…2 b and c. The solutions are composed of two identical modules, each performing a XOR computation, and a third module that performs AND or OR on the output of the XORs. Notably, the XOR modules, each made of four NAND gates, are precisely the minimal XOR implementation used in electronic engineering (36,37). In each experiment, the difference between the perfect solutions for the two goals differ by two connections.…”

Section: ]mentioning

confidence: 99%

Spontaneous evolution of modularity and network motifs

Kashtan

Alon²

2005

Proc. Natl. Acad. Sci. U.S.A.

760

783

View full text Add to dashboard Cite

Biological networks have an inherent simplicity: they are modular with a design that can be separated into units that perform almost independently. Furthermore, they show reuse of recurring patterns termed network motifs. Little is known about the evolutionary origin of these properties. Current models of biological evolution typically produce networks that are highly nonmodular and lack understandable motifs. Here, we suggest a possible explanation for the origin of modularity and network motifs in biology. We use standard evolutionary algorithms to evolve networks. A key feature in this study is evolution under an environment (evolutionary goal) that changes in a modular fashion. That is, we repeatedly switch between several goals, each made of a different combination of subgoals. We find that such ''modularly varying goals'' lead to the spontaneous evolution of modular network structure and network motifs. The resulting networks rapidly evolve to satisfy each of the different goals. Such switching between related goals may represent biological evolution in a changing environment that requires different combinations of a set of basic biological functions. The present study may shed light on the evolutionary forces that promote structural simplicity in biological networks and offers ways to improve the evolutionary design of engineered systems. B iological and engineered systems share general design features: they display modularity, defined as the separability of the design into units that perform independently, at least to a first approximation (1-3, 5). † Furthermore, they show reuse of certain circuit patterns, termed network motifs (6-11), in many different parts of the system. These features allow construction of extremely complex systems by using simple building blocks (12).These features of biological networks are not captured by most current models of biological evolution. For example, many models of biological evolution use computers to evolve networks to attain a defined goal. In these simulations, networks in a population are varied by means of mutations, crossover, and duplication (13-15). Networks that perform better are selected in the next generation. A well known feature of these computational models of biological evolution is that the evolved systems are usually intricately wired and nonmodular. The nonmodular solutions are often more highly optimized than their human-engineered counterparts (16,17,20).The fundamental reason for the lack of modularity in these evolved networks is that modular structures are usually less optimal than nonmodular ones. Typically, there are many possible connections that break modularity and increase fitness. Thus, even an initially modular solution rapidly evolves into one of many possible nonmodular solutions.Lack of modularity is one of the reasons that computational evolution can currently generate designs for simple tasks, but has difficulty in scaling up to higher complexity. In the field of evolutionary design of engineered systems, approaches have been dev...

show abstract

Section: ]mentioning

confidence: 99%

Spontaneous evolution of modularity and network motifs

Kashtan

Alon²

2005

Proc. Natl. Acad. Sci. U.S.A.

760

783

View full text Add to dashboard Cite

show abstract

“…Figure 6 shows the hardware of the analysis environment used in this research. In the next step, HDL-code of benchmark ICs of the ISCAS-85 ISCAS-89 and ISCAS-99 series [6] and [7] werĩ mplemented into MATLAB and used to prove the correct mode of operation of the classification procedure. Due to current limitation of the whole separation procedure to maximum of ten inputs and ten outputs only benchmarks with less than ten ins and outs are used.…”

Section: Resultsmentioning

confidence: 99%

Structural division procedure for efficient IC analysis

Brutscheck¹,

Berger²,

Franke³

et al. 2008

IET Irish Signals and Systems Conference (ISSC 2008)

View full text Add to dashboard Cite

show abstract

“…5 Applying the same word propagation algorithm to "TS Router", 52 (instead of 54) words were found. Comparing the words inferred in the two netlists directly was difficult since the wires were named differently.…”

Section: B Cmp Routermentioning

confidence: 99%

“…Hansen et al [5] present a study of reverse engineering the well-known ISCAS-85 combinational circuits. They present several strategies, mostly manual, to reverse engineer circuit functionality from a gate-level schematic.…”

Section: Related Workmentioning

confidence: 99%

WordRev: Finding word-level structures in a sea of bit-level gates

Gascón

Subramanyan

et al. 2013

2013 IEEE International Symposium on Hardware-Oriented Security and Trust (HOST)

View full text Add to dashboard Cite

Abstract-Systems are increasingly being constructed from offthe-shelf components acquired through a globally distributed and untrusted supply chain. Often only post-synthesis gate-level netlists or actual silicons are available for security inspection. This makes reasoning about hardware trojans particularly challenging given the enormous scale of the problem. Currently, there is no mature methodology that can provide visibility into a bitlevel design in terms of high-level components to allow more comprehensive analysis. In this paper, we present a systemic way of automatically deriving word-level structures from the gatelevel netlist of a digital circuit. Our framework also provides the possibility for a user to specify sequences of word-level operations and it can extract the collection of gates corresponding to those operations. We demonstrate the effectiveness of our approach on a system-on-a-chip (SoC) design consisting of approximately 400,000 IBM 12SOI cells and several open-source designs.

show abstract

Unveiling the ISCAS-85 benchmarks: a case study in reverse engineering

Cited by 381 publications

References 10 publications

Spontaneous evolution of modularity and network motifs

Spontaneous evolution of modularity and network motifs

Structural division procedure for efficient IC analysis

WordRev: Finding word-level structures in a sea of bit-level gates

Contact Info

Product

Resources

About