Cryptology ePrint Archive: Report 2020/324

Defeating CAS-Unlock

Bicky Shakya and Xiaolin Xu and Mark Tehranipoor and Domenic Forte

Abstract: Recently, a logic locking approach termed `CAS-Lock' was proposed to simultaneously counter Boolean satisfiability (SAT) and bypass attacks. The technique modifies the AND/OR tree structure in Anti-SAT to achieve non-trivial output corruptibility while maintaining resistance to both SAT and bypass attacks. An attack against CAS-Lock (dubbed `CAS-Unlock') was also recently proposed on a naive implementation of CAS-Lock. It relies on setting key values to all 1's or 0's to break CAS-Lock. In this short paper, we evaluate this attack's ineffectiveness and describe a misinterpretation of CAS-Lock's implementation.

Category / Keywords: applications / Logic Locking; Combinational Locking

Date: received 16 Mar 2020

Contact author: bshakya at ufl edu,xiaolin8@uic edu,tehranipoor@ece ufl edu,dforte@ece ufl edu

Available format(s): PDF | BibTeX Citation

Version: 20200317:183255 (All versions of this report)

Short URL: ia.cr/2020/324


[ Cryptology ePrint archive ]