Nozomu Togawa

Nozomu Togawa

Auto-generated profile, based on publicly available information

Nozomu Togawa

Department of Computer Science and Communications Engineering, Waseda University, Shinjuku, Tokyo, Japan

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 May 2017
Verified
Conference Paper
Closed access
KHKento Hasegawa
Kento Hasegawa
MYMasao Yanagisawa
Masao Yanagisawa
NTNozomu Togawa
Nozomu Togawa
Recently, due to the increase of outsourcing in IC design, it has been reported that malicious third-party vendors often insert hardware Trojans into their ICs. How to detect them is a strong concern in IC design process. The features of hardware-Trojan infected nets (or Trojan nets) in ICs often differ from those of normal nets. To classify all the nets in netlists designed by third-party vendors into Trojan ones and normal ones, we have to extract effective Trojan features from Trojan nets. In this paper, we first propose 51 Trojan features which describe Trojan nets from netlists. Based on the importance values obtained from the random forest classifier, we extract the best set of 11 Trojan features out of the 51 features which can effectively detect Trojan nets, maximizing the F-measures. By using the 11 Trojan features extracted, the machine-learning based hardware Trojan classifier has achieved at most 100% true positive rate as well as 100% true negative rate in several TrustHUB benchmarks and obtained the average F-measure of 74.6%, which realizes the best values among existing machine-learning-based hardware-Trojan detection methods.

24 October 2016
Verified
Conference Paper
Closed access
KHKento Hasegawa
Kento Hasegawa
MOMasaru Oya
Masaru Oya
MYMasao Yanagisawa
Masao Yanagisawa
NTNozomu Togawa
Nozomu Togawa
Recently, we face a serious risk that malicious third-party vendors can very easily insert hardware Trojans into their IC products but it is very difficult to analyze huge and complex ICs. In this paper, we propose a hardware-Trojan classification method to identify hardware-Trojan infected nets (or Trojan nets) using a support vector machine (SVM). Firstly, we extract the five hardware-Trojan features in each net in a netlist. Secondly, since we cannot effectively give the simple and fixed threshold values to them to detect hardware Trojans, we represent them to be a five-dimensional vector and learn them by using SVM. Finally, we can successfully classify a set of all the nets in an unknown netlist into Trojan ones and normal ones based on the learned SVM classifier. We have applied our SVM-based hardware-Trojan classification method to Trust-HUB benchmarks and the results demonstrate that our method can much increase the true positive rate compared to the existing state-of-the-art results in most of the cases. In some cases, our method can achieve the true positive rate of 100%, which shows that all the Trojan nets in a netlist are completely detected by our method.

1 July 2017
Verified
Conference Paper
Closed access
KHKento Hasegawa
Kento Hasegawa
MYMasao Yanagisawa
Masao Yanagisawa
NTNozomu Togawa
Nozomu Togawa
Recently, due to the increase of outsourcing in IC design and manufacturing, it has been reported that malicious third-party IC vendors often insert hardware Trojans into their products. Especially in IC design step, it is strongly required to detect hardware Trojans because malicious third-party vendors can easily insert hardware Trojans in their products. In this paper, we propose a machine-learning-based hardware-Trojan detection method for gate-level netlists using multi-layer neural networks. First, we extract 11 Trojan-net feature values for each net in a netlist. After that, we classify the nets in an unknown netlist into a set of Trojan nets and that of normal nets using multi-layer neural networks. We obtained at most 100% true positive rate with our proposed method.

19 May 2021 in IEEE Access
Verified
Journal Article
Open access
KTKensuke Tamura
Kensuke Tamura
TSTatsuhiko Shirai
Tatsuhiko Shirai
HKHosho Katsura
Hosho Katsura
STShu Tanaka
Shu Tanaka
NTNozomu Togawa
Nozomu Togawa
The differences in performance among binary-integer encodings in an Ising machine, which can solve combinatorial optimization problems, are investigated. Many combinatorial optimization problems can be mapped to find the lowest-energy (ground) state of an Ising model or its equivalent model, the Quadratic Unconstrained Binary Optimization (QUBO). Since the Ising model and QUBO consist of binary variables, they often express integers as binary when using Ising machines. A typical example is the combinatorial optimization problem under inequality constraints. Here, the quadratic knapsack problem is adopted as a prototypical problem with an inequality constraint. It is solved using typical binary-integer encodings: one-hot encoding, binary encoding, and unary encoding. Unary encoding shows the best performance for large-sized problems.

1 January 2015
Verified
Conference Paper
Closed access
PDF file
MOMasaru Oya
Masaru Oya
YSYouhua Shi
Youhua Shi
MYMasao Yanagisawa
Masao Yanagisawa
NTNozomu Togawa
Nozomu Togawa
Recently, digital ICs are often designed by outside vendors to reduce design costs in semiconductor industry, which may introduce severe risks that malicious attackers implement Hardware Trojans (HTs) on them. Since IC design phase generates only a s...

1 January 2010 in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Verified
Journal Article
Closed access
RNRyuta Nara
Ryuta Nara
KSKei Satoh
Kei Satoh
MYMasao Yanagisawa
Masao Yanagisawa
TOTatsuo Ohtsuki
Tatsuo Ohtsuki
NTNozomu Togawa
Nozomu Togawa