On the Difficulty of Inserting Trojans in Reversible Computing Architectures

被引:8
|
作者
Cui, Xiaotong [1 ,2 ]
Saeed, Samah Mohamed [3 ]
Zulehner, Alwin [4 ]
Wille, Robert [4 ]
Wu, Kaijie [5 ]
Drechsler, Rolf [7 ,8 ]
Karri, Ramesh [6 ]
机构
[1] Chongqing Univ Posts & Telecommun, Sch Cyber Secur & Informat Law, Chongqing 400065, Peoples R China
[2] Chongqing Univ, Coll Comp Sci, Comp Sci & Technol, Chongqing 400044, Peoples R China
[3] Univ Washington, Inst Technol, Comp Engn, Tacoma, WA 98195 USA
[4] Johannes Kepler Univ Linz, Inst Integrated Circuits, A-4040 Linz, Austria
[5] NYU, Tandon Sch Engn, 550 1St Ave, New York, NY 10003 USA
[6] NYU, Tandon Sch Engn, Elect & Comp Engn, 550 1St Ave, New York, NY 10003 USA
[7] Univ Bremen, Grp Comp Architecture, Inst Comp Sci, D-28359 Bremen, Germany
[8] DFKI GmbH, D-28359 Bremen, Germany
基金
美国国家科学基金会;
关键词
Trojan horses; Hardware; Logic gates; Security; Foundries; Integrated circuits; Adders; Hardware Trojans; design for trust; reversible circuits; scrambling; ancillary inputs; LOGIC; ALGORITHM;
D O I
10.1109/TETC.2018.2823315
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Fabrication-less design houses outsource their designs to third-party foundries to lower fabrication cost. However, this creates opportunities for a rogue in the semiconductor foundry to introduce hardware Trojans, which stay inactive most of the time and cause unintended consequences to the system when triggered. Hardware Trojans in traditional CMOS-based circuits have been studied, and Design-for-Trust (DFT) techniques have been proposed to detect them. Different from traditional circuits in many ways, reversible circuits implement one-to-one input/output mappings. In this paper, we investigate the security implications of reversible circuits with a particular focus on the susceptibility to hardware Trojans. To this end, we consider reversible functions implemented using reversible circuits as well as irreversible functions embedded in reversible circuits.
引用
收藏
页码:960 / 972
页数:13
相关论文
共 50 条
  • [31] High performance computing architectures
    Yang, Mei
    Jiang, Yingtao
    Wang, Ling
    Yang, Yulu
    COMPUTERS & ELECTRICAL ENGINEERING, 2009, 35 (06) : 815 - 816
  • [32] Computing on Knights and Kepler Architectures
    Bortolotti, G.
    Caberletti, M.
    Crimi, G.
    Ferraro, A.
    Giacomini, F.
    Manzali, M.
    Maron, G.
    Pivanti, M.
    Salomoni, D.
    Schifano, S. F.
    Tripiccione, R.
    Zanella, M.
    20TH INTERNATIONAL CONFERENCE ON COMPUTING IN HIGH ENERGY AND NUCLEAR PHYSICS (CHEP2013), PARTS 1-6, 2014, 513
  • [33] Security Architectures for Cloud Computing
    Okuhara, Masayuki
    Shiozaki, Tetsuo
    Suzuki, Takuya
    FUJITSU SCIENTIFIC & TECHNICAL JOURNAL, 2010, 46 (04): : 397 - 402
  • [34] Transistor realization of reversible TSG gate and reversible adder architectures
    Thapliyal, Himanshu
    Vinod, A. P.
    2006 IEEE ASIA PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS, 2006, : 418 - +
  • [35] Hierarchical Synthesis of Quantum and Reversible Architectures
    Archimedes Pavlidis
    Dimitris Gizopoulos
    International Journal of Parallel Programming, 2016, 44 : 1028 - 1053
  • [36] Hierarchical Synthesis of Quantum and Reversible Architectures
    Pavlidis, Archimedes
    Gizopoulos, Dimitris
    INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING, 2016, 44 (05) : 1028 - 1053
  • [37] Difficulty in Inserting 25- and 23-Gauge Trocar Cannula during Vitrectomy
    Kunikata, Hiroshi
    Nitta, Fumihiko
    Meguro, Yasuhiko
    Aizawa, Naoko
    Hariya, Takehiro
    Chiba, Naoki
    Abe, Toshiaki
    Nishida, Kohji
    OPHTHALMOLOGICA, 2011, 226 (04) : 198 - 204
  • [38] Computing the degree of difficulty in understanding Chinese compounds
    Ye, Wenxi
    Qiu, Likun
    LANGUAGE AND LINGUISTICS, 2008, 9 (02) : 435 - 447
  • [39] On the difficulty of computing higher-twist corrections
    Martinelli, G
    Sachrajda, CT
    NUCLEAR PHYSICS B, 1996, 478 (03) : 660 - 684
  • [40] DIFFICULTY IN COMPUTING K-EFFECTIVE OF WORLD
    WHITESIDES, GE
    TRANSACTIONS OF THE AMERICAN NUCLEAR SOCIETY, 1971, 14 (02): : 680 - +