Publications

On the security of sequential logic locking against oracle-guided attacks

Abstract

The Boolean satisfiability (SAT) attack is an oracle-guided attack that can break most combinational logic locking schemes by efficiently pruning out all the wrong keys from the search space. Extending such an attack to sequential logic locking requires multiple time-consuming rounds of SAT solving, performed using an “unrolled” version of the sequential circuit, and model checking, used to determine the successful termination of the attack. This article addresses these challenges by formally characterizing the relation between the minimum unrolling depth required to prune out the wrong keys of an SAT-based attack and a notion of functional corruptibility (FC) for sequential circuits, which can be efficiently estimated from a locked circuit to indicate the progress of an SAT-based attack. Based on this analysis, we present an FC-guided SAT-based attack that can significantly reduce unnecessary SAT and model-checking …

Metadata

publication
IEEE Transactions on Computer-Aided Design of Integrated Circuits and …, 2023
year
2023
publication date
2023/3/7
authors
Yinghua Hu, Yuke Zhang, Kaixin Yang, Dake Chen, Peter A Beerel, Pierluigi Nuzzo
link
https://ieeexplore.ieee.org/abstract/document/10061617/
journal
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
volume
42
issue
11
pages
3628-3641
publisher
IEEE