Abstract
Cyclic logic encryption is a newly proposed circuit obfuscation technique in hardware security. It was claimed to be SAT-unresolvable because feedback cycles were intentionally inserted under keys into the encryption. We show in the paper that even though feedback cycles introduce extra difficulty for an attacker, they can still be overcome with SAT-based techniques. Specifically, we propose CycSAT Algorithms based on SAT with different acyclic conditions that can efficiently decrypt cyclic encryptions. Experimental results have shown that our CycSAT is efficient and effective to decrypt cyclic encryptions, and we need to develop new encryptions with better security properties.
Original language | English (US) |
---|---|
Title of host publication | 2017 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2017 |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 49-56 |
Number of pages | 8 |
ISBN (Electronic) | 9781538630938 |
DOIs | |
State | Published - Dec 13 2017 |
Event | 36th IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2017 - Irvine, United States Duration: Nov 13 2017 → Nov 16 2017 |
Publication series
Name | IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD |
---|---|
Volume | 2017-November |
ISSN (Print) | 1092-3152 |
Other
Other | 36th IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2017 |
---|---|
Country/Territory | United States |
City | Irvine |
Period | 11/13/17 → 11/16/17 |
Funding
This work is partially supported by NSF under CNS-1441695, CCF-1533656, CNS-1651695, and by SRC under 2014-TS-2559.
ASJC Scopus subject areas
- Software
- Computer Science Applications
- Computer Graphics and Computer-Aided Design