Paper 2018/1146

Functional Analysis Attacks on Logic Locking

Deepak Sirone and Pramod Subramanyan


This paper proposes Functional Analysis attacks on state of the art Logic Locking algorithms (abbreviated as FALL attacks). FALL attacks have two stages. The first stage identifies nodes involved in the locking functionality and analyzes functional properties of these nodes to shortlist a small number of candidate locking keys. In many cases, this shortlists exactly one locking key, so no further analysis is needed. However, if more than one key is shortlisted, the second stage introduces a SAT-based algorithm to identify the correct locking key from a list of alternatives using simulations on an unlocked circuit. In comparison to past work, the FALL attack is more practical as it can often succeed (90% of successful attempts in our experiments) by only analyzing the locked netlist, without requiring oracle access to an unlocked circuit. Further, FALL attacks successfully defeat Secure Function Logic Locking (SFLL), the only locking algorithm that is resilient to known attacks on logic locking. Our experimental evaluation shows that FALL is able to defeat 65 out of 80 (81%) circuits locked using SFLL.

Note: Minor editing and reformatting.

Available format(s)
-- withdrawn --
Publication info
Published elsewhere. MAJOR revision.Design Automation and Test in Europe (DATE) 2019
logic lockingSATfunctional analysishardware
Contact author(s)
spramod @ cse iitk ac in
2018-12-05: withdrawn
2018-12-03: received
See all versions
Short URL
Creative Commons Attribution
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.