Security risk evaluation for logic locking
The Integrated Circuit (IC) supply chain is facing multiple challenges as the globalization develops. Untrustworthy entities like chip manufacturers violated the intellectual properties and cause enormous economic loss. This circumstance highlights a necessity of robust logic obfuscation solutions t...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Final Year Project (FYP) |
| Language: | English |
| Published: |
Nanyang Technological University
2024
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/177126 |
| _version_ | 1826120182459793408 |
|---|---|
| author | Diao, Shengjia |
| author2 | Gwee Bah Hwee |
| author_facet | Gwee Bah Hwee Diao, Shengjia |
| author_sort | Diao, Shengjia |
| collection | NTU |
| description | The Integrated Circuit (IC) supply chain is facing multiple challenges as the globalization develops. Untrustworthy entities like chip manufacturers violated the intellectual properties and cause enormous economic loss. This circumstance highlights a necessity of robust logic obfuscation solutions to eliminate the dangers to the greatest extent and a comprehensive security evaluation system on those solutions keep abreast of the times. Boolean Satisfiability (SAT) attacks can almost break all existent logic obfuscation techniques. It is accepted as a powerful tool to assess the security of the logic obfuscation methods by the academia as well. However, the SAT attack faces significant challenges of logic locking on complex circuits, especially multipliers.
In this report, we propose a novel SAT-based circuit preprocessing attack, named Xattack based on the concept of logic cones to enhance the efficacy of SAT attacks on complex circuits like multipliers. To enhance the efficiency of the SAT attacks on multiplier circuits, we partition the complex circuits into sub-circuits by logic cones, conducting SAT attacks on them iteratively. We analyze the reasons behind the significant resilience of multipliers and make comprehensive comparison between the SAT attack and proposed Xattack on ISCAS’85 benchmark circuits and 8-bit, 12-bit, 18-bit multipliers synthesized by ourselves. With 300 key gates inserted into the 18-bit multiplier, the result reported a reduction of over 1.5 million seconds, showcasing the superiority of our proposed method with an average 80% reduction in attacking time. This holds significant implications for strengthening efficiency of hardware security evaluation. |
| first_indexed | 2024-10-01T05:12:00Z |
| format | Final Year Project (FYP) |
| id | ntu-10356/177126 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2024-10-01T05:12:00Z |
| publishDate | 2024 |
| publisher | Nanyang Technological University |
| record_format | dspace |
| spelling | ntu-10356/1771262024-05-31T15:43:12Z Security risk evaluation for logic locking Diao, Shengjia Gwee Bah Hwee School of Electrical and Electronic Engineering ebhgwee@ntu.edu.sg Computer and Information Science Engineering Logic locking Boolean satisfiability attack The Integrated Circuit (IC) supply chain is facing multiple challenges as the globalization develops. Untrustworthy entities like chip manufacturers violated the intellectual properties and cause enormous economic loss. This circumstance highlights a necessity of robust logic obfuscation solutions to eliminate the dangers to the greatest extent and a comprehensive security evaluation system on those solutions keep abreast of the times. Boolean Satisfiability (SAT) attacks can almost break all existent logic obfuscation techniques. It is accepted as a powerful tool to assess the security of the logic obfuscation methods by the academia as well. However, the SAT attack faces significant challenges of logic locking on complex circuits, especially multipliers. In this report, we propose a novel SAT-based circuit preprocessing attack, named Xattack based on the concept of logic cones to enhance the efficacy of SAT attacks on complex circuits like multipliers. To enhance the efficiency of the SAT attacks on multiplier circuits, we partition the complex circuits into sub-circuits by logic cones, conducting SAT attacks on them iteratively. We analyze the reasons behind the significant resilience of multipliers and make comprehensive comparison between the SAT attack and proposed Xattack on ISCAS’85 benchmark circuits and 8-bit, 12-bit, 18-bit multipliers synthesized by ourselves. With 300 key gates inserted into the 18-bit multiplier, the result reported a reduction of over 1.5 million seconds, showcasing the superiority of our proposed method with an average 80% reduction in attacking time. This holds significant implications for strengthening efficiency of hardware security evaluation. Bachelor's degree 2024-05-27T05:04:34Z 2024-05-27T05:04:34Z 2024 Final Year Project (FYP) Diao, S. (2024). Security risk evaluation for logic locking. Final Year Project (FYP), Nanyang Technological University, Singapore. https://hdl.handle.net/10356/177126 https://hdl.handle.net/10356/177126 en application/pdf Nanyang Technological University |
| spellingShingle | Computer and Information Science Engineering Logic locking Boolean satisfiability attack Diao, Shengjia Security risk evaluation for logic locking |
| title | Security risk evaluation for logic locking |
| title_full | Security risk evaluation for logic locking |
| title_fullStr | Security risk evaluation for logic locking |
| title_full_unstemmed | Security risk evaluation for logic locking |
| title_short | Security risk evaluation for logic locking |
| title_sort | security risk evaluation for logic locking |
| topic | Computer and Information Science Engineering Logic locking Boolean satisfiability attack |
| url | https://hdl.handle.net/10356/177126 |
| work_keys_str_mv | AT diaoshengjia securityriskevaluationforlogiclocking |