Sequential logic locking has been studied over the last decade as a method to protect sequential circuits from reverse engineering. However, most of the existing sequential logic locking techniques are threatened by increasingly more sophisticated SAT-based attacks, efficiently using input queries to a SAT solver to rule out incorrect keys, as well as removal attacks based on structural analysis. In this paper, we propose TriLock, a sequential logic locking method that simultaneously addresses these vulnerabilities. TriLock can achieve high, tunable functional corruptibility while still guaranteeing exponential queries to the SAT solver in a SAT-based attack. Further, it adopts a state re-encoding method to obscure the boundary between the original state registers and those inserted by the locking method, thus making it more difficult to detect and remove the locking-related components.
翻译:过去十年来,人们一直在研究序列逻辑锁定作为保护连续电路不受逆向工程影响的一种方法,但是,大多数现有的连续逻辑锁定技术都受到日益尖端的SAT攻击的威胁,高效地利用对SAT求解器的输入查询排除不正确的键,以及基于结构分析的清除攻击。在本文中,我们提议TriLock是一种同时解决这些脆弱性的顺序逻辑锁定方法。TriLock可以实现高、可金枪鱼功能腐败,同时仍然保证在SAT攻击中向SAT求解器进行指数式查询。此外,它采用了一种州级重新编码方法来模糊最初的国家登记册与锁定方法所插入的登记册之间的界限,从而使探测和清除与锁定有关的部件更加困难。