On the detectability of hardware trojans embedded in parallel multipliers

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper presents a new method for analyzing the detectability of a hardware Trojan (HT) that has infected parallel multipliers. The proposed method handles the Rare Path Trojan (RPT) that exploits the difficulty in activating a specific path of a parallel multiplier. In this paper we analyze some typical multipliers from the viewpoints of RPT characteristics and insertion/detection possibility. The validity of our criteria is evaluated by multiple regression analysis. Our experimental result indicates that a multiplier based on a redundant binary tree has a larger detectability than other ones.

Original languageEnglish
Title of host publicationProceedings - 2018 IEEE 48th International Symposium on Multiple-Valued Logic, ISMVL 2018
PublisherIEEE Computer Society
Pages62-67
Number of pages6
ISBN (Electronic)9781538644638
DOIs
Publication statusPublished - 2018 Jul 19
Event48th IEEE International Symposium on Multiple-Valued Logic, ISMVL 2018 - Linz, Austria
Duration: 2018 May 162018 May 18

Publication series

NameProceedings of The International Symposium on Multiple-Valued Logic
Volume2018-May
ISSN (Print)0195-623X

Conference

Conference48th IEEE International Symposium on Multiple-Valued Logic, ISMVL 2018
Country/TerritoryAustria
CityLinz
Period18/5/1618/5/18

Keywords

  • Arithmetic Algorithms
  • Hardware Trojans
  • Multipliers
  • Path Delay Faults

Fingerprint

Dive into the research topics of 'On the detectability of hardware trojans embedded in parallel multipliers'. Together they form a unique fingerprint.

Cite this