An Efficient SAT-Attack Algorithm Against Logic Encryption

Yusuke Matsunaga, Masayoshi Yoshimura

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publication2019 IEEE 25th International Symposium on On-Line Testing and Robust System Design, IOLTS 2019
EditorsDimitris Gizopoulos, Dan Alexandrescu, Panagiota Papavramidou, Michail Maniatakos
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages44-47
Number of pages4
ISBN (Electronic)9781728124902
DOIs
Publication statusPublished - Jul 2019
Event25th IEEE International Symposium on On-Line Testing and Robust System Design, IOLTS 2019 - Rhodes, Greece
Duration: Jul 1 2019Jul 3 2019

Publication series

Name2019 IEEE 25th International Symposium on On-Line Testing and Robust System Design, IOLTS 2019

Conference

Conference25th IEEE International Symposium on On-Line Testing and Robust System Design, IOLTS 2019
CountryGreece
CityRhodes
Period7/1/197/3/19

Fingerprint

Cryptography
Program processors
Networks (circuits)
Experiments

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence
  • Computer Networks and Communications
  • Hardware and Architecture
  • Safety, Risk, Reliability and Quality

Cite this

Matsunaga, Y., & Yoshimura, M. (2019). An Efficient SAT-Attack Algorithm Against Logic Encryption. In D. Gizopoulos, D. Alexandrescu, P. Papavramidou, & M. Maniatakos (Eds.), 2019 IEEE 25th International Symposium on On-Line Testing and Robust System Design, IOLTS 2019 (pp. 44-47). [8854466] (2019 IEEE 25th International Symposium on On-Line Testing and Robust System Design, IOLTS 2019). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/IOLTS.2019.8854466

An Efficient SAT-Attack Algorithm Against Logic Encryption. / Matsunaga, Yusuke; Yoshimura, Masayoshi.

2019 IEEE 25th International Symposium on On-Line Testing and Robust System Design, IOLTS 2019. ed. / Dimitris Gizopoulos; Dan Alexandrescu; Panagiota Papavramidou; Michail Maniatakos. Institute of Electrical and Electronics Engineers Inc., 2019. p. 44-47 8854466 (2019 IEEE 25th International Symposium on On-Line Testing and Robust System Design, IOLTS 2019).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Matsunaga, Y & Yoshimura, M 2019, An Efficient SAT-Attack Algorithm Against Logic Encryption. in D Gizopoulos, D Alexandrescu, P Papavramidou & M Maniatakos (eds), 2019 IEEE 25th International Symposium on On-Line Testing and Robust System Design, IOLTS 2019., 8854466, 2019 IEEE 25th International Symposium on On-Line Testing and Robust System Design, IOLTS 2019, Institute of Electrical and Electronics Engineers Inc., pp. 44-47, 25th IEEE International Symposium on On-Line Testing and Robust System Design, IOLTS 2019, Rhodes, Greece, 7/1/19. https://doi.org/10.1109/IOLTS.2019.8854466
Matsunaga Y, Yoshimura M. An Efficient SAT-Attack Algorithm Against Logic Encryption. In Gizopoulos D, Alexandrescu D, Papavramidou P, Maniatakos M, editors, 2019 IEEE 25th International Symposium on On-Line Testing and Robust System Design, IOLTS 2019. Institute of Electrical and Electronics Engineers Inc. 2019. p. 44-47. 8854466. (2019 IEEE 25th International Symposium on On-Line Testing and Robust System Design, IOLTS 2019). https://doi.org/10.1109/IOLTS.2019.8854466
Matsunaga, Yusuke ; Yoshimura, Masayoshi. / An Efficient SAT-Attack Algorithm Against Logic Encryption. 2019 IEEE 25th International Symposium on On-Line Testing and Robust System Design, IOLTS 2019. editor / Dimitris Gizopoulos ; Dan Alexandrescu ; Panagiota Papavramidou ; Michail Maniatakos. Institute of Electrical and Electronics Engineers Inc., 2019. pp. 44-47 (2019 IEEE 25th International Symposium on On-Line Testing and Robust System Design, IOLTS 2019).
@inproceedings{ee53c24c128a43e2a7b69f210e6b20ae,
title = "An Efficient SAT-Attack Algorithm Against Logic Encryption",
abstract = "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.",
author = "Yusuke Matsunaga and Masayoshi Yoshimura",
year = "2019",
month = "7",
doi = "10.1109/IOLTS.2019.8854466",
language = "English",
series = "2019 IEEE 25th International Symposium on On-Line Testing and Robust System Design, IOLTS 2019",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "44--47",
editor = "Dimitris Gizopoulos and Dan Alexandrescu and Panagiota Papavramidou and Michail Maniatakos",
booktitle = "2019 IEEE 25th International Symposium on On-Line Testing and Robust System Design, IOLTS 2019",
address = "United States",

}

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

AN - SCOPUS:85073717064

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.

ER -