A novel method for watermarking sequential circuits

We propose a novel technique to watermark sequential circuits by embedding a signature via state encoding. The proposed technique is a greedy heuristic for the subgraph matching problem, which has two steps: (a) watermark graph construction and (b) watermark embedding in the State Transition Graph of the FSM. Due to combinatorial complexity, reverse engineering and erasing the watermark from the FSM is not feasible with finite resources/time. The signature can be extracted by applying a specific secret sequence which is generated by the embedding algorithm. Experimental results on benchmarks chosen from IWLS' 93 suite, show that this is a secure and flexible method for protecting sequential circuit based Intellectual Property cores.

[1]  Srinivas Devadas,et al.  General Decomposition of Sequential Machines: Relationships to State Assignment , 1989, 26th ACM/IEEE Design Automation Conference.

[2]  John Paul Shen,et al.  Evaluation and synthesis of self-monitoring state machines , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[3]  Changming Sun,et al.  Digital Image Computing: Techniques and Applications , 2003 .

[5]  George H. Mealy,et al.  A method for synthesizing sequential circuits , 1955 .

[6]  Jean-Baptiste Note,et al.  From the bitstream to the netlist , 2008, FPGA '08.

[7]  Swarup Bhunia,et al.  HARPOON: An Obfuscation-Based SoC Design Methodology for Hardware Protection , 2009, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[8]  Jong-Wha Chong,et al.  New state assignment algorithms for finite state machines using look ahead , 1991, Proceedings of the IEEE 1991 Custom Integrated Circuits Conference.

[9]  Gerd Rietsche.  State assignment for finite state machines using T flip-flops , 1993, Proceedings of EURO-DAC 93 and EURO-VHDL 93- European Design Automation Conference.

[10]  Mathieu Bastian,et al.  Gephi: An Open Source Software for Exploring and Manipulating Networks , 2009, ICWSM.

[11]  Edoardo Charbon.  Hierarchical watermarking in IC design , 1998, Proceedings of the IEEE 1998 Custom Integrated Circuits Conference (Cat. No.98CH36143).

[12]  Daniel J. Rosenkrantz.  Half-Hot State Assignments for Finite State Machines , 1990, IEEE Trans. Computers.

[13]  Alberto L. Sangiovanni-Vincentelli,et al.  MUSTANG: state assignment of finite state machines targeting multilevel logic implementations , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[14]  Jukka Saarinen,et al.  Finite state machine encoding for VHDL synthesis , 2001 .

[15]  Kiyoung Choi,et al.  SAT-based state encoding for peak current Minimization , 2009, 2009 International SoC Design Conference (ISOCC).

[16]  Michel R. C. M. Berkelaar,et al.  Improved state assignment for burst mode finite state machines , 1997, Proceedings Third International Symposium on Advanced Research in Asynchronous Circuits and Systems.

[17]  R.K. Singh,et al.  Multiplexer targeted finite state machine encoding for area and power minimization , 2004, Proceedings of the IEEE INDICON 2004. First India Annual Conference, 2004..

[18]  Luis Entrena,et al.  Partitioned state encoding for low power in FPGAs , 2005 .

[19]  Guo-Ruey Tsai,et al.  Watermarking Technique for HDL-based IP Module Protection , 2007, Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007).

[20]  C. Silvano,et al.  Low-power state assignment techniques for finite state machines , 2000, 2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353).

[21]  Imtiaz Ahmad,et al.  On state assignment of finite state machines using hypercube embedding approach , 1999, Proceedings 1999 IEEE International Conference on Computer Design: VLSI in Computers and Processors (Cat. No.99CB37040).

[22]  Chip-Hong Chang,et al.  State encoding watermarking for field authentication of sequential circuit intellectual property , 2012, 2012 IEEE International Symposium on Circuits and Systems.

[23]  Yuesheng Zhu,et al.  A digital copyright protection scheme for soft-IP core based on FSMs , 2011, 2011 International Conference on Consumer Electronics, Communications and Networks (CECNet).

[24]  Hans-Joachim Wunderlich,et al.  Optimized synthesis of self-testable finite state machines , 1990, [1990] Digest of Papers. Fault-Tolerant Computing: 20th International Symposium.

[25]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[26]  Irith Pomeranz,et al.  GALLOP: genetic algorithm based low power FSM synthesis by simultaneous partitioning and state assignment , 2003, 16th International Conference on VLSI Design, 2003. Proceedings..

[27]  Biplab K. Sikdar,et al.  Power conscious BIST design for sequential circuits using ghost-FSM , 2003, 2003 Test Symposium.

[28]  De-Sheng Chen,et al.  State Encoding of Finite State Machines for Low Power Design , 1996, J. Circuits Syst. Comput..

[29]  Robert K. Brayton,et al.  Solving the state assignment problem for signal transition graphs , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[30]  Sofiène Tahar,et al.  A public-key watermarking technique for IP designs , 2005, Design, Automation and Test in Europe.

[31]  Markus Damm.  State Assignment for Detecting Erroneous Transitions in Finite State Machines , 2006, 9th EUROMICRO Conference on Digital System Design (DSD'06).

[32]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[33]  Donald B. Johnson,et al.  Efficient Algorithms for Shortest Paths in Sparse Networks , 1977, J. ACM.

[34]  Marek Perkowski,et al.  The encoding program for concurrent finite state machines realized using PLD devices , 1990, Proceedings of the 33rd Midwest Symposium on Circuits and Systems.

[35]  S. Yang,et al.  Logic Synthesis and Optimization Benchmarks User Guide Version 3.0 , 1991 .

[36]  Tam Anh Chu,et al.  A new state assignment technique for asynchronous finite state machines , 1993, [1993] Proceedings Third Great Lakes Symposium on VLSI-Design Automation of High Performance VLSI Systems.

[37]  Arlindo L. Oliveira.  Robust techniques for watermarking sequential circuit designs , 1999, DAC '99.

[38]  Robert K. Brayton,et al.  Optimal State Assignment for Finite State Machines , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[39]  B.F. Tawadros,et al.  State assignment for low-leakage finite state machines , 2005, The 3rd International IEEE-NEWCAS Conference, 2005..

[40]  Sofiène Tahar,et al.  A Robust FSM Watermarking Scheme for IP Protection of Sequential Circuit Design , 2011, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[41]  Technológia.  Finite-State Machine , 2010 .

[42]  A. Richard Newton,et al.  MUSE: a multilevel symbolic encoding algorithm for state assignment , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[43]  S. Subbaraman,et al.  Intellectual Property Protection of Sequential Circuits Using Digital Watermarking , 2006, First International Conference on Industrial and Information Systems.

[44]  Arlindo L. Oliveira.  Techniques for the creation of digital watermarks in sequentialcircuit designs , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[45]  J. Langelaar,et al.  The location, polarization and assignment of low lying excited triplet states in pyrene , 1970 .

[46]  Sofiène Tahar,et al.  Finite State Machine IP Watermarking: A Tutorial , 2006, First NASA/ESA Conference on Adaptive Hardware and Systems (AHS'06).

[47]  Xiaoyun Wang,et al.  Finding Collisions in the Full SHA-1 , 2005, CRYPTO.

[48]  Sofiène Tahar,et al.  IP watermarking techniques: survey and comparison , 2003, The 3rd IEEE International Workshop on System-on-Chip for Real-Time Applications, 2003. Proceedings..

[49]  Miodrag Potkonjak,et al.  Robust IP watermarking methodologies for physical design , 1998, Proceedings 1998 Design and Automation Conference. 35th DAC. (Cat. No.98CH36175).

[50]  Gary K. Maki,et al.  Improved State Assignment Selection Tests , 1972, IEEE Transactions on Computers.

[51]  Sofiène Tahar,et al.  Fragile IP Watermarking Techniques , 2008, 2008 NASA/ESA Conference on Adaptive Hardware and Systems.

[52]  Bart Preneel,et al.  RIPEMD-160: A Strengthened Version of RIPEMD , 1996, FSE.

[53]  M. Karnaugh.  The map method for synthesis of combinational logic circuits , 1953, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[54]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[55]  W. F,et al.  The Evolution of Electronic Publishing , 2007 .

[56]  Lawrence O'Gorman,et al.  Electronic marking and identification techniques to discourage document copying , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[57]  Vincent Rijmen,et al.  On the Collision Resistance of RIPEMD-160 , 2006, ISC.

[58]  M. Potkonjak,et al.  FPGA fingerprinting techniques for protecting intellectual property , 1998, Proceedings of the IEEE 1998 Custom Integrated Circuits Conference (Cat. No.98CH36143).

[59]  Farinaz Koushanfar,et al.  Provably secure obfuscation of diverse watermarks for sequential circuits , 2010, 2010 IEEE International Symposium on Hardware-Oriented Security and Trust (HOST).

[60]  Sung-Mo Kang,et al.  State assignment for low-power FSM synthesis using genetic local search , 1994, Proceedings of IEEE Custom Integrated Circuits Conference - CICC '94.

[61]  I. Torunoglu,et al.  Watermarking-based copyright protection of sequential functions , 2000, IEEE Journal of Solid-State Circuits.

[62]  A. Tirkel,et al.  Electronic water mark , 1993 .

[63]  Adrian Stoica,et al.  "Glitch Logic" and Applications to Computing and Information Security , 2009, 2009 Symposium on Bio-inspired Learning and Intelligent Systems for Security.

[64]  Chip-Hong Chang,et al.  Watermarking for IP Protection through Template Substitution at Logic Synthesis Level , 2007, 2007 IEEE International Symposium on Circuits and Systems.

[65]  Vladimir Batagelj,et al.  Pajek - Program for Large Network Analysis , 1999 .

[66]  Edward F. Moore,et al.  Gedanken-Experiments on Sequential Machines , 1956 .

[67]  Swarup Bhunia,et al.  Hardware protection and authentication through netlist level obfuscation , 2008, 2008 IEEE/ACM International Conference on Computer-Aided Design.

[68]  Richard W. Hamming,et al.  Error detecting and error correcting codes , 1950 .

[69]  E.M. Aboulhamid,et al.  A tool for automatic watermarking of IP designs , 2004, The 2nd Annual IEEE Northeast Workshop on Circuits and Systems, 2004. NEWCAS 2004..

[70]  Donatella Sciuto,et al.  A state encoding for self-checking finite state machines , 1995, Proceedings of ASP-DAC'95/CHDL'95/VLSI'95 with EDA Technofair.

[71]  Christof Paar,et al.  Side-channel based watermarks for integrated circuits , 2010, 2010 IEEE International Symposium on Hardware-Oriented Security and Trust (HOST).

[72]  Lech Jozwiak,et al.  A new state assignment method targeting FPGA implementations , 2000, Proceedings of the 26th Euromicro Conference. EUROMICRO 2000. Informatics: Inventing the Future.

[73]  Calvin C. Elgot,et al.  Mealy George H.. A method for synthesizing sequential circuits. The Bell System technical journal, vol. 34 (1955), pp. 1045–1079. , 1957, Journal of Symbolic Logic (JSL).

[74]  Chip-Hong Chang,et al.  A hybrid watermarking scheme for sequential functions , 2011, 2011 IEEE International Symposium of Circuits and Systems (ISCAS).

[75]  Youn-Long Lin,et al.  State assignment for power and area minimization , 1994, Proceedings 1994 IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[76]  L. Thorelli,et al.  An algorithm for computing all paths in a graph , 1966 .