Rajit Karmakar
ABSTRACT
A popular countermeasure against IP piracy relies on obfuscating the Finite State Machine (FSM), which is assumed to be the heart of a digital system. In this paper, we propose to use a special class of non-group additive cellular automata (CA) called D1 * CA, and it's counterpart D1 * CAdual to obfuscate each state-transition of an FSM. The synthesized FSM exhibits correct state-transitions only for a correct key, which is a designer's secret. The proposed easily testable key-controlled FSM synthesis scheme can thwart reverse engineering attacks, thus offers IP protection.
- Yousra Alkabani and Farinaz Koushanfar. 2007. Active Hardware Metering for Intellectual Property Protection and Security.. In USENIX security symposium. 291--306. Google Scholar
Digital Library
- Rajat Subhra Chakraborty and Swarup Bhunia. 2009. HARPOON: an obfuscation-based SoC design methodology for hardware protection. TCAD 28, 10 (2009), 1493--1502. Google ScholarDigital Library
- Supratik Chakraborty, Dipanwita Roy Chowdhury, and Parimal Pal Chaudhuri. 1996. Theory and application of nongroup cellular automata for synthesis of easily testable finite state machines. IEEE Trans. Comput. 7 (1996), 769--781. Google ScholarDigital Library
- Parimal Pal Chaudhuri, Dipanwita Roy Chowdhury, Sukumar Nandi, and Santanu Chattopadhyay. 1997. Additive cellular automata: theory and applications. Vol. 1. John Wiley & Sons.Google Scholar
- Avinash R Desai, Michael S Hsiao, Chao Wang, Leyla Nazhandali, and Simin Hall. 2013. Interlocking obfuscation for anti-tamper hardware. In Cyber Security and Information Intelligence Research Workshop. ACM, 8. Google ScholarDigital Library
- Jaya Dofe and Qiaoyan Yu. 2018. Novel dynamic state-deflection method for gate-level design obfuscation. TCAD 37, 2 (2018), 273--285. Google ScholarDigital Library
- Marc Fyrbiak, Sebastian Wallat, Jonathan Déchelotte, Nils Albartus, Sinan Böcker, Russell Tessier, and Christof Paar. 2018. On the Difficulty of FSM-based Hardware Obfuscation. IACR Transactions on Cryptographic Hardware and Embedded Systems (2018), 293--330.Google Scholar
- Travis Meade, Yier Jin, Mark Tehranipoor, and Shaojie Zhang. 2016. Gate-level netlist reverse engineering for hardware security: Control logic register identification. In ISCAS. IEEE, 1334--1337.Google Scholar
- Travis Meade, Zheng Zhao, Shaojie Zhang, David Pan, and Yier Jin. 2017. Revisit sequential logic obfuscation: Attacks and defenses. In ISCAS. IEEE, 1--4.Google Scholar
- Masoud Rostami, Farinaz Koushanfar, and Ramesh Karri. 2014. A primer on hardware security: Models, methods, and metrics. Proc. IEEE 102, 8 (2014), 1283--1295.Google ScholarCross Ref
- Jarrod A Roy, Farinaz Koushanfar, and Igor L Markov. 2008. EPIC: Ending piracy of integrated circuits. In DATE. 1069--1074. Google ScholarDigital Library
- Yiqiong Shi, Chan Wai Ting, Bah-Hwee Gwee, and Ye Ren. 2010. A highly efficient method for extracting FSMs from flattened gate-level netlist. In ISCAS. IEEE, 2610--2613.Google Scholar
- Pramod Subramanyan, Sayak Ray, and Sharad Malik. 2015. Evaluating the security of logic encryption algorithms. In HOST. 137--143.Google Scholar
Recommendations
Residual Finite State Automata
STACS '01: Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer ScienceWe introduce a subclass of non deterministic finite automata (NFA) that we call Residual Finite State Automata (RFSA): a RFSA is a NFA all the states of which define residual languages of the language it recognizes. We prove that for every regular ...
On the power of quantum finite state automata
FOCS '97: Proceedings of the 38th Annual Symposium on Foundations of Computer ScienceIn this paper, we introduce 1-way and 2-way quantum finite state automata (1qfa's and 2qfa's), which are the quantum analogues of deterministic, nondeterministic and probabilistic 1-way and 2-way finite state automata. We prove the following facts ...
State complexity of unambiguous operations on finite automata
AbstractThe paper determines the number of states in finite automata necessary to represent “unambiguous” variants of the union, concatenation, and Kleene star operations on formal languages. For the disjoint union of languages represented by ...
Comments