SMARTLock: SAT Attack and Removal Attack-Resistant Tree-Based Logic Locking

Yung-Chih CHEN

doi:10.1587/transfun.2019EAP1055

SMARTLock: SAT Attack and Removal Attack-Resistant Tree-Based Logic Locking

Yung-Chih CHEN

Full Text Views

0

Cite this

Summary :

Logic encryption is an IC protection technique which inserts extra logic and key inputs to hide a circuit's functionality. An encrypted circuit needs to be activated with a secret key for being functional. SAT attack and Removal attack are two most advanced decryption methods that have shown their effectiveness to break most of the existing logic encryption methods within a few hours. In this paper, we propose SMARTLock, a SAT attack and reMoval Attack-Resistant Tree-based logic Locking method, for resisting them simultaneously. To encrypt a circuit, the method finds large AND and OR functions in it and encrypts them by inserting duplicate tree functions. There are two types of structurally identical tree encryptions that aim to resist SAT attack and Removal attack, respectively. The experimental results show that the proposed method is effective for encrypting a set of benchmarks from ISCAS'85, MCNC, and IWLS. 16 out of 40 benchmarks encrypted by the proposed method with the area overhead of no more than 5% are uncrackable by SAT attack within 5 hours. Additionally, compared to the state-of-the-art logic encryption methods, the proposed method provides better security for most benchmarks.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E103-A No.5 pp.733-740

Publication Date: 2020/05/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1587/transfun.2019EAP1055

Type of Manuscript: PAPER

Category: VLSI Design Technology and CAD

Authors

Yung-Chih CHEN
Yuan Ze University

Keyword

logic encryption, IC camouflaging, IC protection, SAT attack

Cite this

Copy

Yung-Chih CHEN, "SMARTLock: SAT Attack and Removal Attack-Resistant Tree-Based Logic Locking" in IEICE TRANSACTIONS on Fundamentals, vol. E103-A, no. 5, pp. 733-740, May 2020, doi: 10.1587/transfun.2019EAP1055.
Abstract: Logic encryption is an IC protection technique which inserts extra logic and key inputs to hide a circuit's functionality. An encrypted circuit needs to be activated with a secret key for being functional. SAT attack and Removal attack are two most advanced decryption methods that have shown their effectiveness to break most of the existing logic encryption methods within a few hours. In this paper, we propose SMARTLock, a SAT attack and reMoval Attack-Resistant Tree-based logic Locking method, for resisting them simultaneously. To encrypt a circuit, the method finds large AND and OR functions in it and encrypts them by inserting duplicate tree functions. There are two types of structurally identical tree encryptions that aim to resist SAT attack and Removal attack, respectively. The experimental results show that the proposed method is effective for encrypting a set of benchmarks from ISCAS'85, MCNC, and IWLS. 16 out of 40 benchmarks encrypted by the proposed method with the area overhead of no more than 5% are uncrackable by SAT attack within 5 hours. Additionally, compared to the state-of-the-art logic encryption methods, the proposed method provides better security for most benchmarks.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2019EAP1055/_p

Copy

@ARTICLE{e103-a_5_733,
author={Yung-Chih CHEN, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={SMARTLock: SAT Attack and Removal Attack-Resistant Tree-Based Logic Locking},
year={2020},
volume={E103-A},
number={5},
pages={733-740},
abstract={Logic encryption is an IC protection technique which inserts extra logic and key inputs to hide a circuit's functionality. An encrypted circuit needs to be activated with a secret key for being functional. SAT attack and Removal attack are two most advanced decryption methods that have shown their effectiveness to break most of the existing logic encryption methods within a few hours. In this paper, we propose SMARTLock, a SAT attack and reMoval Attack-Resistant Tree-based logic Locking method, for resisting them simultaneously. To encrypt a circuit, the method finds large AND and OR functions in it and encrypts them by inserting duplicate tree functions. There are two types of structurally identical tree encryptions that aim to resist SAT attack and Removal attack, respectively. The experimental results show that the proposed method is effective for encrypting a set of benchmarks from ISCAS'85, MCNC, and IWLS. 16 out of 40 benchmarks encrypted by the proposed method with the area overhead of no more than 5% are uncrackable by SAT attack within 5 hours. Additionally, compared to the state-of-the-art logic encryption methods, the proposed method provides better security for most benchmarks.},
keywords={},
doi={10.1587/transfun.2019EAP1055},
ISSN={1745-1337},
month={May},}

Copy

TY - JOUR
TI - SMARTLock: SAT Attack and Removal Attack-Resistant Tree-Based Logic Locking
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 733
EP - 740
AU - Yung-Chih CHEN
PY - 2020
DO - 10.1587/transfun.2019EAP1055
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E103-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2020
AB - Logic encryption is an IC protection technique which inserts extra logic and key inputs to hide a circuit's functionality. An encrypted circuit needs to be activated with a secret key for being functional. SAT attack and Removal attack are two most advanced decryption methods that have shown their effectiveness to break most of the existing logic encryption methods within a few hours. In this paper, we propose SMARTLock, a SAT attack and reMoval Attack-Resistant Tree-based logic Locking method, for resisting them simultaneously. To encrypt a circuit, the method finds large AND and OR functions in it and encrypts them by inserting duplicate tree functions. There are two types of structurally identical tree encryptions that aim to resist SAT attack and Removal attack, respectively. The experimental results show that the proposed method is effective for encrypting a set of benchmarks from ISCAS'85, MCNC, and IWLS. 16 out of 40 benchmarks encrypted by the proposed method with the area overhead of no more than 5% are uncrackable by SAT attack within 5 hours. Additionally, compared to the state-of-the-art logic encryption methods, the proposed method provides better security for most benchmarks.
ER -