TY - GEN
T1 - An Efficient SAT-Attack Algorithm Against Logic Encryption
AU - Matsunaga, Yusuke
AU - Yoshimura, Masayoshi
PY - 2019/7
Y1 - 2019/7
N2 - This paper presents a novel efficient SAT-attack algorithm for logic encryption. The existing SAT-attack algorithm can decrypt almost all encrypted circuits proposed so far, however, there are cases that it takes a huge amount of CPU time. This is because the number of clauses being added during the decryption increases drastically in that case. To overcome that problem, a novel algorithm is developed, which considers the equivalence of clauses to be added. Experiments show that the proposed algorithm is much faster than the existing algorithm.
AB - This paper presents a novel efficient SAT-attack algorithm for logic encryption. The existing SAT-attack algorithm can decrypt almost all encrypted circuits proposed so far, however, there are cases that it takes a huge amount of CPU time. This is because the number of clauses being added during the decryption increases drastically in that case. To overcome that problem, a novel algorithm is developed, which considers the equivalence of clauses to be added. Experiments show that the proposed algorithm is much faster than the existing algorithm.
UR - http://www.scopus.com/inward/record.url?scp=85073717064&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85073717064&partnerID=8YFLogxK
U2 - 10.1109/IOLTS.2019.8854466
DO - 10.1109/IOLTS.2019.8854466
M3 - Conference contribution
T3 - 2019 IEEE 25th International Symposium on On-Line Testing and Robust System Design, IOLTS 2019
SP - 44
EP - 47
BT - 2019 IEEE 25th International Symposium on On-Line Testing and Robust System Design, IOLTS 2019
A2 - Gizopoulos, Dimitris
A2 - Alexandrescu, Dan
A2 - Papavramidou, Panagiota
A2 - Maniatakos, Michail
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 25th IEEE International Symposium on On-Line Testing and Robust System Design, IOLTS 2019
Y2 - 1 July 2019 through 3 July 2019
ER -