Paper 2021/109 Original: eprint.iacr.org/2021/109 ↗

Sequential Logic Encryption Against Model Checking Attack

Amin Rezaei
Hai Zhou
Abstract

Due to high IC design costs and emergence of countless untrusted foundries, logic encryption has been taken into consideration more than ever. In state-of-the-art logic encryption works, a lot of performance is sold to guarantee security against both the SAT-based and the removal attacks. However, the SAT-based attack cannot decrypt the sequential circuits if the scan chain is protected or if the unreachable states encryption is adopted. Instead, these security schemes can be defeated by the model checking attack that searches iteratively for different input sequences to put the activated IC to the desired reachable state. In this paper, we propose a practical logic encryption approach to defend against the model checking attack on sequential circuits. The robustness of the proposed approach is demonstrated by experiments on around fifty benchmarks.

Metadata
Available format(s)
PDF
Category
Applications
Publication info
Preprint.
History
2021-02-01: last updated
2021-02-01: published
Short URL
https://ia.cr/2021/109
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2021/109,
      author = {Amin Rezaei and Hai Zhou},
      title = {Sequential Logic Encryption Against Model Checking Attack},
      howpublished = {Cryptology {ePrint} Archive, Paper 2021/109},
      year = {2021},
      url = {https://eprint.iacr.org/2021/109}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.