簡易檢索 / 詳目顯示

研究生: 楊翔閔
Yang, Xiang-Min
論文名稱: 對於迴路鎖邏輯加密技術的安全性分析之研究
Security Analysis for a Cyclic Logic Locking Method - LOOPLock
指導教授: 王俊堯
Wang, Chun-Yao
口試委員: 黃俊達
Huang, Juinn-Dar
江介宏
Jiang, Jie-Hong
學位類別: 碩士
Master
系所名稱: 電機資訊學院 - 資訊工程學系
Computer Science
論文出版年: 2020
畢業學年度: 108
語文別: 英文
論文頁數: 36
中文關鍵詞: 硬體安全迴路化邏輯加密邏輯解密布林滿足性破解法迴路化布林滿足性破解法迴路鎖
外文關鍵詞: Hardware security, Cyclic Logic Locking, Logic Decryption, SAT Attack, CycSAT, LOOPLock
相關次數: 點閱:2下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 迴路鎖是硬體安全領域中最先進的邏輯加密技術。與其他邏輯加密技術不同,它通過一種邏輯優化技術在電路中創建迴路,以混淆攻擊者。透過在電路中使用兩種類型的迴路序對,迴路鎖能夠同時使SAT Attack,Removal Attack和CycSAT無效。在本文中,我們分析了迴路鎖的加密機制,並提出了一種基於加密結構分析的攻擊方法。實驗結果展示了該攻擊方法的有效性和效率。進一步地,基於此攻擊方式,我們設計了新的加密結構用以強化迴路鎖的加密安全性。


    LOOPLock is the state-of-the-art logic locking method in hardware security. Different from other logic locking methods, it creates cycles in the circuit by a logic optimization technique for obfuscating attackers. LOOPLock is able to invalidate SAT Attack, Removal Attack, and CycSAT simultaneously by introducing two types of cycle pairs in a circuit. In this work, we analyze LOOPLock's locking mechanism and propose an attacking approach based on locking structure analysis. Experimental results show the efficiency and effectiveness of the proposed attacking approach. With this attacking approach, designers could further strengthen the protection of LOOPLock.

    中文摘要-----------------------------------------------------------------i Abstract-----------------------------------------------------------------ii 誌謝辭-------------------------------------------------------------------iii Contents-----------------------------------------------------------------iv List of Tables-----------------------------------------------------------vi List of Figures----------------------------------------------------------vii 1 Introduction-----------------------------------------------------1 2 Related Works----------------------------------------------------6 2.1 SAT Attack-------------------------------------------------------6 2.2 CycSAT-----------------------------------------------------------7 3 Preliminaries----------------------------------------------------9 3.1 Background-------------------------------------------------------9 3.2 Node Merging (NM)------------------------------------------------10 3.3 NM-based cycle generation----------------------------------------12 3.4 LOOPLock---------------------------------------------------------15 4 Our Attacking Approach-------------------------------------------19 4.1 Shortcomings of LOOPLock-----------------------------------------19 4.2 Blocking Node Identification-------------------------------------21 4.3 The Proposed Unlocking Flow--------------------------------------22 5 Our Enhanced Approach--------------------------------------------25 5.1 The Enhanced Structure for LOOPLock------------------------------25 5.2 Subcircuit Duplication Approach for the Type-II Cycle Pair ------28 6 Experimental Results---------------------------------------------30 7 Conclusion-------------------------------------------------------33

    [1] Jui-Hung Chen, Yung-Chih Chen, Wan-Chen Weng, Ching-Yi Huang and Chun-Yao Wang, “Synthesis and Verification of Cyclic Combinational Circuits,” in Proc. of SOCC, 2015, pp. 257-262.
    [2] Yung-Chih Chen and Chun-Yao Wang, “Fast Detection of Node Mergers using Logic Implications,” in Proc. of ICCAD, 2009, pp. 785-788.
    [3] Yung-Chih Chen and Chun-Yao Wang, “Fast Node Merging with Don’t Cares Using Logic Implications,” IEEE Trans. on Computer-Aided Design of Inte- grated Circuits and Systems, 2010, pp. 1827-1832.
    [4] Hsiao-Yu Chiang, Yung-Chih Chen, De-Xuan Ji, Xiang-Min Yang, Chia-Chun Lin, and Chun-Yao Wang, “LOOPLock: LOgic OPtimization based Cyclic Logic Locking,” IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, 2019.
    [5] Sophie Dupuis, Papa-Sidi Ba, Giorgio Di Natale, Marie-Lise Flottes and Bruno Rouzeyre, “A Novel Hardware Logic Encryption Technique for Thwarting Il- legal Overproduction and Hardware Trojans,” in Proc. of IEEE IOLTS, 2014, pp. 49-54.
    [6] Malay K. Ganai, Lintao Zhang, Pranav Ashar, Aarti Gupta and Sharad Malik, “Combining Strengths of Circuit-based and CNF-based Algorithms for a High- Performance SAT Solver,” in Proc. of DAC, 2002, pp.747-750.
    [7] Matthew W. Moskewicz, Conor F. Madigan, Ying Zhao, Lintao Zhang and Sharad Malik, “Chaff: Engineering an Efficient SAT Solver,” in Proc. of DAC, 2001, pp.530-535.

    [8] Jeyavijayan Rajendran, Huan Zhang, Chi Zhang, Garrett S. Rose, Youngok Pino, Ozgur Sinanoglu and Ramesh Karri, “Fault Analysis-Based Logic En- cryption,” IEEE Trans. on Computers, 2015, vol. 64, no. 2, pp. 410-424.
    [9] Jeyavijayan Rajendran, Youngok Pino, Ozgur Sinanoglu and Ramesh Karri, “Logic Encryption: A Fault Analysis Perspective,” in Proc. of DATE, 2012, pp. 953-958.
    [10] Amin Rezaei, Yuanqi Shen, Shuyu Kong, Jie Gu and Hai Zhou, “Cyclic Lock- ing and Memristor-based Obfuscation Against CycSAT and Inside Foundry Attacks,” in Proc. of DATE, 2018, pp. 85-90.
    [11] Amin Rezaei, You Li, Yuanqi Shen, Shuyu Kong and Hai Zhou, “CycSAT- Unresolvable Cyclic Logic Encryption Using Unreachable States,” in Proc. of ASPDAC, 2019, pp. 358-363.
    [12] Shervin Roshanisefat, Hadi Mardani Kamali and Avesta Sasan, “SRClock: SAT-Resistant Cyclic Logic Locking for Protecting the Hardware,” in Proc. of GLSVLSI, 2018, pp. 153-158.
    [13] Shervin Roshanisefat, Hadi Mardani Kamali, Houman Homayoun and Avesta Sasan, ”SAT-Hard Cyclic Logic Obfuscation for Protecting the IP in the Manu- facturing Supply Chain,” IEEE Trans. on Very Large Scale Integration Systems, 2020, vol. 28, no. 4, pp. 954-967.
    [14] Jarrod A. Roy, Farinaz Koushanfar and Igor L. Markov, “Ending Piracy of Integrated Circuits,” Computer, 2010, vol. 43, no. 10, pp. 30-38.
    [15]J. Paul Roth, Willard G. Bouricius and Peter R. Schneider, “Programmed Algorithms to Compute Tests to Detect and Distinguish Between Failures in Logic Circuits, ” IEEE Trans. on Electronic Computers, 1967, vol. EC-16, no. 5, pp. 567-580.
    [16] Kaveh Shamsi, Meng Li, Travis Meade, Zheng Zhao, David Z. Pan and Yier Jin, “Cyclic Obfuscation for Creating SAT-Unresolvable Circuits,” in Proc. of GLSVLSI, 2017, pp. 173-178.

    [17] Yuanqi Shen, You Li, Amin Rezaei, Shuyu Kong, David Dlott and Hai Zhou, “BeSAT: Behavioral SAT-based Attack on Cyclic Logic Encryption,” in Proc. of ASPDAC, 2019, pp. 657-662.
    [18] Pramod Subramanyan, Sayak Ray and Sharad Malik, “Evaluating the Security of Logic Encryption Algorithms,” in Proc. of HOST, 2015, pp. 137-143.
    [19] Yang Xie and Ankur Srivastava, “Mitigating SAT Attack on Logic Locking,” in Proc. of International Conference on Cryptographic Hardware and Embedded Systems, 2016, pp. 127-146.
    [20] Muhammad Yasin, Bodhisatwa Mazumdar, Jeyavijayan Rajendran and Ozgur Sinanoglu, “SARlock: SAT Attack Resistant Logic Locking,” in Proc. of HOST, 2016, pp. 236-241.
    [21] Muhammad Yasin, Bodhisatwa Mazumdar, Ozgur Sinanoglu and Jeyavijayan Rajendran, “Removal Attacks on Logic Locking and Camouflaging Tech- niques,” IEEE Trans. on Emerging Topics in Computing, 2017, to be published.
    [22] Muhammad Yasin, Bodhisatwa Mazumdar, Ozgur Sinanoglu and Jeyavijayan Rajendran, “Security Analysis of Anti-SAT,” in Proc. of ASPDAC, 2016, pp. 342-347.
    [23] Muhammad Yasin, Jeyavijayan JV Rajendran, Ozgur Sinanoglu and Ramesh Karri, “On Improving the Security of Logic Locking,” IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, 2016, vol. 35, no. 9, pp. 1411-1424.
    [24] Hai Zhou, Ruifeng Jiang and Shuyu Kong, “CycSAT: SAT-Based Attack on Cyclic Logic Encryptions,” in Proc. of ICCAD, 2017, pp. 49-56.
    [25] IWLS2005 Benchmarks. [Online]. Available: http://iwls.org/iwls2005/ benchmarks.html
    [26] Berkeley Logic Synthesis and Verificaiton Group. ABC: A System for Sequential Synthesis and Verification. [Online]. Available: http://www.eecs.berkeley. edu/~alanmi/abc

    QR CODE