GALU: A Genetic Algorithm Framework for Logic Unlocking

Huili Chen, Cheng Fu, Jishen Zhao, F. Koushanfar
{"title":"GALU: A Genetic Algorithm Framework for Logic Unlocking","authors":"Huili Chen, Cheng Fu, Jishen Zhao, F. Koushanfar","doi":"10.1145/3491256","DOIUrl":null,"url":null,"abstract":"Logic locking is a circuit obfuscation technique that inserts additional key gates to the original circuit in order to prevent potential threats such as circuit overproduction, piracy, and counterfeiting. The encrypted circuit generates desired outputs only when the correct keys are applied to the key gates. Previous works have identified the vulnerability of logic locking to satisfiability (SAT)-based attacks. However, SAT attacks are unscalable and have limited effectiveness on circuits with SAT-hard structures. To address the above constraints, we propose GALU, the first genetic algorithm-based logic unlocking framework that is parallelizable and significantly faster than the conventional SAT-based counterparts. GALU works by formulating circuit deobfuscation (i.e., identifying the correct keys) as a combinatorial optimization problem and approaches it using genetic algorithms (GAs). We consider key sequences as individuals in distinct populations and propose an adaptive, diversity-guided GA framework consisting of four main steps: circuit fitness evaluation, population selection, crossover, and mutation. In each iteration, the key sequences with high fitness scores are selected and transformed into the offspring key sequences. As a result of evolutionary key searching, GALU is highly scalable, effective, and efficient. To optimize the runtime overhead of logic unlocking, we integrate the design of GALU’s algorithm, software and hardware in a closed loop. In particular, we identify circuit fitness evaluation as the performance bottleneck and employ hardware emulation on programmable hardware for runtime optimization. To this end, GALU framework automatically constructs customized auxiliary circuitry to pipeline the computation in constraints checking, sorting, crossover, and mutation. GALU is the first adaptive and scalable attack framework that provides the flexibility/trade-off between runtime overhead and key usability. This is achieved by producing a group of approximate keys with improving quality over time. We perform a comprehensive evaluation of GALU’s performance on various benchmarks and demonstrate that GALU achieves up to 1089.2× speedup and 4268.6× more energy-efficiency compared to the state-of-the-art SAT attacks for circuit logic unlocking.","PeriodicalId":202552,"journal":{"name":"Digital Threats: Research and Practice","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Digital Threats: Research and Practice","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3491256","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Logic locking is a circuit obfuscation technique that inserts additional key gates to the original circuit in order to prevent potential threats such as circuit overproduction, piracy, and counterfeiting. The encrypted circuit generates desired outputs only when the correct keys are applied to the key gates. Previous works have identified the vulnerability of logic locking to satisfiability (SAT)-based attacks. However, SAT attacks are unscalable and have limited effectiveness on circuits with SAT-hard structures. To address the above constraints, we propose GALU, the first genetic algorithm-based logic unlocking framework that is parallelizable and significantly faster than the conventional SAT-based counterparts. GALU works by formulating circuit deobfuscation (i.e., identifying the correct keys) as a combinatorial optimization problem and approaches it using genetic algorithms (GAs). We consider key sequences as individuals in distinct populations and propose an adaptive, diversity-guided GA framework consisting of four main steps: circuit fitness evaluation, population selection, crossover, and mutation. In each iteration, the key sequences with high fitness scores are selected and transformed into the offspring key sequences. As a result of evolutionary key searching, GALU is highly scalable, effective, and efficient. To optimize the runtime overhead of logic unlocking, we integrate the design of GALU’s algorithm, software and hardware in a closed loop. In particular, we identify circuit fitness evaluation as the performance bottleneck and employ hardware emulation on programmable hardware for runtime optimization. To this end, GALU framework automatically constructs customized auxiliary circuitry to pipeline the computation in constraints checking, sorting, crossover, and mutation. GALU is the first adaptive and scalable attack framework that provides the flexibility/trade-off between runtime overhead and key usability. This is achieved by producing a group of approximate keys with improving quality over time. We perform a comprehensive evaluation of GALU’s performance on various benchmarks and demonstrate that GALU achieves up to 1089.2× speedup and 4268.6× more energy-efficiency compared to the state-of-the-art SAT attacks for circuit logic unlocking.
逻辑解锁的遗传算法框架
逻辑锁定是一种电路混淆技术,它在原始电路中插入额外的密钥门,以防止电路生产过剩、盗版和假冒等潜在威胁。只有当正确的密钥应用于密钥门时,加密电路才产生所需的输出。以前的工作已经确定了逻辑锁定对基于可满足性(SAT)的攻击的脆弱性。然而,SAT攻击是不可扩展的,并且对具有SAT硬结构的电路的有效性有限。为了解决上述限制,我们提出了GALU,这是第一个基于遗传算法的逻辑解锁框架,它是可并行的,并且比传统的基于sat的框架快得多。GALU的工作原理是将电路去混淆(即识别正确的键)作为组合优化问题,并使用遗传算法(GAs)进行处理。我们将关键序列视为不同种群中的个体,并提出了一个适应性的、多样性导向的遗传框架,该框架由四个主要步骤组成:电路适应度评估、种群选择、交叉和突变。在每次迭代中,选择适应度得分高的关键序列并将其转化为后代关键序列。由于演化式关键字搜索,GALU具有高度可伸缩性、有效性和高效性。为了优化逻辑解锁的运行时开销,我们将GALU的算法、软件和硬件设计集成在一个闭环中。特别是,我们将电路适应度评估确定为性能瓶颈,并在可编程硬件上采用硬件仿真进行运行时优化。为此,GALU框架自动构建定制化的辅助电路,将约束检查、排序、交叉、突变等计算流水线化。GALU是第一个自适应和可扩展的攻击框架,它提供了运行时开销和关键可用性之间的灵活性/权衡。这是通过生成一组随着时间的推移而提高质量的近似键来实现的。我们在各种基准测试中对GALU的性能进行了全面评估,并证明与电路逻辑解锁的最先进的SAT攻击相比,GALU实现了高达1089.2倍的加速和4268.6倍的能效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信