TL;DR
GNNUnlock introduces a novel graph neural network-based attack that effectively identifies protection logic in secure logic-locked circuits without needing an oracle, outperforming existing methods across various benchmarks.
Contribution
The paper presents the first oracle-less GNN-based attack on provably secure logic locking, combining GNNs with connectivity analysis for high-accuracy detection.
Findings
Achieves 99.24%-100% success rate in breaking various logic locking schemes.
Post-processing improves detection accuracy to 100%.
Breaks schemes that resist state-of-the-art attacks under different conditions.
Abstract
In this paper, we propose GNNUnlock, the first-of-its-kind oracle-less machine learning-based attack on provably secure logic locking that can identify any desired protection logic without focusing on a specific syntactic topology. The key is to leverage a well-trained graph neural network (GNN) to identify all the gates in a given locked netlist that belong to the targeted protection logic, without requiring an oracle. This approach fits perfectly with the targeted problem since a circuit is a graph with an inherent structure and the protection logic is a sub-graph of nodes (gates) with specific and common characteristics. GNNs are powerful in capturing the nodes' neighborhood properties, facilitating the detection of the protection logic. To rectify any misclassifications induced by the GNN, we additionally propose a connectivity analysis-based post-processing algorithm to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
