An Ultra-efficient Look-up Table based Programmable Processing in Memory Architecture for Data Encryption

被引:4
|
作者
Sutradhar, Purab Ranjan [1 ]
Basu, Kanad [2 ]
Dinakarrao, Sai Manoj Pudukotai [3 ]
Ganguly, Amlan [1 ]
机构
[1] Rochester Inst Technol, Dept Comp Engn, Rochester, NY 14623 USA
[2] Univ Texas Dallas, Dept Elect & Comp Engn, Dallas, TX USA
[3] George Mason Univ, Dept Elect & Comp Engn, Fairfax, VA 22030 USA
关键词
Processing in Memory; DRAM; Data Encryption; AES;
D O I
10.1109/ICCD53106.2021.00049
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Processing in Memory (PIM), a non-von Neumann computing paradigm, has emerged as a faster and more efficient alternative to the traditional computing devices for data-centric applications such as Data Encryption. In this work, we present a novel PIM architecture implemented using programmable Look-up Tables (LUT) inside a DRAM chip to facilitate massively parallel and ultra-efficient data encryption with the Advanced Encryption Standard (AES) algorithm. Its LUT-based architecture replaces logic-based computations with LUT 'look-ups' to minimize power consumption and operational latency. The proposed PIM architecture is organized as clusters of homogeneous, interconnected LUTs that can be dynamically programmed to execute operations required for performing AES encryption. Our simulations show that the proposed PIM architecture can offer up to 14.6x and 1.8 x higher performance compared to CUDA-based implementation of AES Encryption on a high-end commodity GPU and a state-of-the-art GPU Computing Processor, respectively. At the same time, it also achieves 217 x and 31.2 x higher energy efficiency, respectively, than the aforementioned devices while performing AES Encryption.
引用
收藏
页码:252 / 259
页数:8
相关论文
共 50 条
  • [31] A BIST architecture for FPGA look-up table testing reduces reconfigurations
    Atoofian, E
    Navabi, Z
    [J]. ATS 2003: 12TH ASIAN TEST SYMPOSIUM, PROCEEDINGS, 2003, : 84 - 89
  • [32] A shifter look-up table technique based on HXDSP
    Ye, Hong
    Gu, Naijie
    Lin, Chuanwen
    Zhang, Xiaoci
    Chen, Rui
    [J]. Beijing Hangkong Hangtian Daxue Xuebao/Journal of Beijing University of Aeronautics and Astronautics, 2019, 45 (10): : 2044 - 2050
  • [33] A test approach for look-up table based FPGAs
    Atoofian, E
    Navabi, Z
    [J]. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2006, 21 (01) : 141 - 146
  • [34] A Test Approach for Look-Up Table Based FPGAs
    Ehsan Atoofian
    Zainalabedin Navabi
    [J]. Journal of Computer Science and Technology, 2006, 21 : 141 - 146
  • [35] Efficient Realization of Table Look-up based Double Precision Floating Point Arithmetic
    Merchant, Farhad
    Choudhary, Nimash
    Nandy, S. K.
    Narayan, Ranjani
    [J]. 2016 29TH INTERNATIONAL CONFERENCE ON VLSI DESIGN AND 2016 15TH INTERNATIONAL CONFERENCE ON EMBEDDED SYSTEMS (VLSID), 2016, : 415 - 420
  • [36] A NOVEL CHAOTIC IMAGE ENCRYPTION SCHEME BASED ON MAGIC CUBE PERMUTATION AND DYNAMIC LOOK-UP TABLE
    Wang, Xingyuan
    Yang, Lei
    [J]. INTERNATIONAL JOURNAL OF MODERN PHYSICS B, 2012, 26 (29):
  • [37] Look-Up Table Based Implementation of Ultra-Low Complexity Narrowband OFDM Transmitters
    Loulou, AlaaEddin
    Yli-Kaakinen, Juha
    Levanen, Toni
    Lehtinen, Vesa
    Schaich, Frank
    Wild, Thorsten
    Renfors, Markku
    Valkama, Mikko
    [J]. 2019 16TH INTERNATIONAL SYMPOSIUM ON WIRELESS COMMUNICATION SYSTEMS (ISWCS), 2019, : 127 - 132
  • [38] HIGH WORD-RATE DIGITAL-FILTERS WITH PROGRAMMABLE TABLE LOOK-UP
    SCHRODER, H
    [J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1977, 24 (05): : 277 - 279
  • [39] An efficient computation of euclidean distances using approximated look-up table
    Chang, CC
    Chou, JS
    Chen, TS
    [J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, 2000, 10 (04) : 594 - 599
  • [40] Differential Power Processing for Ultra-Efficient Data Storage
    Wang, Ping
    Chen, Yenan
    Yuan, Jing
    Pilawa-Podgurski, Robert C. N.
    Chen, Minjie
    [J]. IEEE TRANSACTIONS ON POWER ELECTRONICS, 2021, 36 (04) : 4269 - 4286