TY - JOUR
T1 - Spin-Orbit Torque Devices for Hardware Security
T2 - From Deterministic to Probabilistic Regime
AU - Patnaik, Satwik
AU - Rangarajan, Nikhil
AU - Knechtel, Johann
AU - Sinanoglu, Ozgur
AU - Rakheja, Shaloo
N1 - Funding Information:
Manuscript received September 12, 2018; revised January 14, 2019; accepted March 20, 2019. Date of publication May 20, 2019; date of current version July 17, 2020. This work was supported in part by the Semiconductor Research Corporation and in part by the National Science Foundation under Grant ECCS 1740136. This work is an extension of [1]. An extended version of this work, providing more background information and examples, can be found in [2]. This paper was recommended by Associate Editor C. H. Chang. (Satwik Patnaik, Nikhil Rangarajan, and Johann Knechtel contributed equally to this work.) (Corresponding authors: Satwik Patnaik; Nikhil Rangarajan; Johann Knechtel; Shaloo Rakheja.) S. Patnaik, N. Rangarajan, and S. Rakheja are with the Department of Electrical and Computer Engineering, Tandon School of Engineering, New York University, Brooklyn, NY 11201 USA (e-mail: sp4012@nyu.edu; nikhil.rangarajan@nyu.edu; shaloo.rakheja@nyu.edu).
Publisher Copyright:
© 1982-2012 IEEE.
PY - 2020/8
Y1 - 2020/8
N2 - Protecting intellectual property (IP) has become a serious challenge for chip designers. Most countermeasures are tailored for CMOS integration and tend to incur excessive overheads, resulting from additional circuitry or device-level modifications. On the other hand, power density is a critical concern for sub-50 nm nodes, necessitating alternate design concepts. Although initially tailored for error-tolerant applications, imprecise computing has gained traction as a general-purpose design technique. Emerging devices are currently being explored to implement ultralow-power circuits for inexact computing applications. In this paper, we quantify the security threats of imprecise computing using emerging devices. More specifically, we leverage the innate polymorphism and tunable stochastic behavior of spin-orbit torque (SOT) devices, particularly, the giant spin-Hall effect (GSHE) switch. We enable IP protection (by means of logic locking and camouflaging) simultaneously for deterministic and probabilistic computing, directly at the GSHE device level. We conduct a comprehensive security analysis using state-of-the-art Boolean satisfiability (SAT) attacks; this paper demonstrates the superior resilience of our GSHE primitive when tailored for deterministic computing. We also demonstrate how probabilistic computing can thwart most, if not all, existing SAT attacks. Based on this finding, we propose an attack scheme called probabilistic SAT (PSAT) which can bypass the defense offered by logic locking and camouflaging for imprecise computing schemes. Further, we illustrate how careful application of our GSHE primitive can remain secure even on the application of the PSAT attack. Finally, we also discuss side-channel attacks and invasive monitoring, which are arguably even more concerning threats than SAT attacks.
AB - Protecting intellectual property (IP) has become a serious challenge for chip designers. Most countermeasures are tailored for CMOS integration and tend to incur excessive overheads, resulting from additional circuitry or device-level modifications. On the other hand, power density is a critical concern for sub-50 nm nodes, necessitating alternate design concepts. Although initially tailored for error-tolerant applications, imprecise computing has gained traction as a general-purpose design technique. Emerging devices are currently being explored to implement ultralow-power circuits for inexact computing applications. In this paper, we quantify the security threats of imprecise computing using emerging devices. More specifically, we leverage the innate polymorphism and tunable stochastic behavior of spin-orbit torque (SOT) devices, particularly, the giant spin-Hall effect (GSHE) switch. We enable IP protection (by means of logic locking and camouflaging) simultaneously for deterministic and probabilistic computing, directly at the GSHE device level. We conduct a comprehensive security analysis using state-of-the-art Boolean satisfiability (SAT) attacks; this paper demonstrates the superior resilience of our GSHE primitive when tailored for deterministic computing. We also demonstrate how probabilistic computing can thwart most, if not all, existing SAT attacks. Based on this finding, we propose an attack scheme called probabilistic SAT (PSAT) which can bypass the defense offered by logic locking and camouflaging for imprecise computing schemes. Further, we illustrate how careful application of our GSHE primitive can remain secure even on the application of the PSAT attack. Finally, we also discuss side-channel attacks and invasive monitoring, which are arguably even more concerning threats than SAT attacks.
KW - Boolean satisfiability (SAT)
KW - giant spin-Hall effect (GSHE)
KW - hardware security
KW - imprecise computing
KW - integrated circuit (IC) camouflaging
KW - probabilistic computing
KW - reverse engineering
KW - spin-orbit torque (SOT)
UR - http://www.scopus.com/inward/record.url?scp=85065959574&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85065959574&partnerID=8YFLogxK
U2 - 10.1109/TCAD.2019.2917856
DO - 10.1109/TCAD.2019.2917856
M3 - Article
AN - SCOPUS:85065959574
SN - 0278-0070
VL - 39
SP - 1591
EP - 1606
JO - IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
JF - IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
IS - 8
M1 - 8718321
ER -