arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2001.08999cs.CR
收藏

制造业供应链中保护IP的SAT-hard循环逻辑混淆

SAT-hard Cyclic Logic Obfuscation for Protecting the IP in the Manufacturing Supply Chain

Shervin Roshanisefat, Hadi Mardani Kamali, Houman Homayoun, Avesta Sasan

摘要:

针对循环逻辑混淆的最新攻击使用配备有一组循环避免子句的可满足性求解器。这些循环避免子句是在预处理步骤中生成的,并且定义了可以打开或关闭循环而不会使电路振荡或有状态的各种键组合。在本文中,我们证明了这个预处理步骤必须在网表中的所有循环上生成循环避免条件,否则,丢失的循环可能会使求解器陷入无限循环或使其以不正确的键退出。然后,我们提出了几种技术,通过这些技术,周期的数量作为插入反馈的数量的函数呈指数级增加。我们进一步说明,当反馈的数量增加时,攻击的预处理步骤面临着复杂性和运行时间的指数级增加,从而防止在合理的时间内正确组合循环避免子句。另一方面,如果预处理未结束,则由可满足性求解器制定的攻击将卡住或以不正确的密钥退出。因此,当本文提出的条件下的循环混淆实现,它会强加一个指数困难的问题,可满足性求解器为基础的攻击。

英文摘要:

State-of-the-art attacks against cyclic logic obfuscation use satisfiability solvers that are equipped with a set of cycle avoidance clauses. These cycle avoidance clauses are generated in a pre-processing step and define various key combinations that could open or close cycles without making the circuit oscillating or stateful. In this paper, we show that this pre-processing step has to generate cycle avoidance conditions on all cycles in a netlist, otherwise, a missing cycle could trap the solver in an infinite loop or make it exit with an incorrect key. Then, we propose several techniques by which the number of cycles is exponentially increased as a function of the number of inserted feedbacks. We further illustrate that when the number of feedbacks is increased, the pre-processing step of the attack faces an exponential increase in complexity and runtime, preventing the correct composition of cycle avoidance clauses in a reasonable time. On the other hand, if the pre-processing is not concluded, the attack formulated by the satisfiability solver will either get stuck or exit with an incorrect key. Hence, when the cyclic obfuscation under the conditions proposed in this paper is implemented, it would impose an exponentially difficult problem for the satisfiability solver based attacks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑