Reverse Engineering Digital ICs through Geometric Embedding of Circuit Graphs

被引:8
作者
Cakir, Burcin [1 ]
Malik, Sharad [1 ]
机构
[1] Princeton Univ, Dept Elect Engn, 41 Olden St, Princeton, NJ 08544 USA
关键词
Reverse engineering; partitioning; clustering;
D O I
10.1145/3193121
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Outsourcing of design and manufacturing processes makes integrated circuits (ICs) vulnerable to adversarial changes and raises concerns about their integrity. Reverse engineering the manufactured netlist helps identify malicious insertions. In this article, we present an automated approach that, given a reference design description with high-level blocks, infers these blocks in an untrusted gate-level (test) implementation. Using the graph connectivity of the netlists, we compute a geometric embedding for each wire in the circuits, which, then, is used to compute a bipartite matching between the nodes of the two designs and identify high-level blocks in the test circuit. Experiments to evaluate the efficacy of the proposed technique on various-sized designs, including the multi-core processor OpenSparc T1, show that it can correctly match over 90% of gates in the test circuit to their corresponding block in the reference model.
引用
收藏
页数:19
相关论文
共 35 条
[11]  
Curtin RR, 2013, J MACH LEARN RES, V14, P801
[12]   THEORETICAL IMPROVEMENTS IN ALGORITHMIC EFFICIENCY FOR NETWORK FLOW PROBLEMS [J].
EDMONDS, J ;
KARP, RM .
JOURNAL OF THE ACM, 1972, 19 (02) :248-&
[13]  
Frankle Jon., 1986, P INT C COMPUTER AID, P414
[14]  
Gascon Adria, 2014, P INT C FORM METH CO
[15]  
Hadley Scott W., 2006, T COMP AIDED DES INT, V11, P885
[16]  
Hagen Lars, 1992, P INT C CONTR AUT DI
[17]   Unveiling the ISCAS-85 benchmarks: A case study in reverse engineering [J].
Hansen, MC ;
Yalcin, H ;
Hayes, JP .
IEEE DESIGN & TEST OF COMPUTERS, 1999, 16 (03) :72-80
[18]   A SHORTEST AUGMENTING PATH ALGORITHM FOR DENSE AND SPARSE LINEAR ASSIGNMENT PROBLEMS [J].
JONKER, R ;
VOLGENANT, A .
COMPUTING, 1987, 38 (04) :325-340
[19]  
Kazmar Tomas, 2017, LINEAR ASSIGNMENT PR
[20]  
Kreyszig Erwin., 2010, ADV ENG MATH, V10th, P339