Scalable digit-serial processor array architecture for finite field division

被引:16
|
作者
Ibrahim, Atef [1 ,2 ,3 ]
机构
[1] Prince Sattam Bin Abdulaziz Univ, Alkharj, Saudi Arabia
[2] Elect Res Inst, Cairo, Egypt
[3] Univ Victoria, ECE Dept, Victoria, BC, Canada
来源
MICROELECTRONICS JOURNAL | 2019年 / 85卷
关键词
Finite field division; Cryptosystems; Processor arrays; Hardware security; Hardware accelerators; SYSTOLIC ARCHITECTURES; MULTIPLICATIVE INVERSION; HIGH-SPEED; GF(2(M)); DESIGN; COMPLEXITY; INVERTER; DIVIDER;
D O I
10.1016/j.mejo.2019.01.011
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper presents a novel scalable digit-serial processor array structure to perform division based on the Stein's division algorithm. The proposed processor array structure enables us to control the number of processing elements as well as the latency of the division operation. This makes us have more flexibility to control the area complexity and the time performance of the divider compared to the previously reported designs. Thus, the presented processor array structure can achieve the time performance requirement of a certain application with minimum hardware resources. The obtained results of the presented design and the previously published competitors' designs indicate that the presented design has a lower area-time product, for bus widths greater than or equal to 26-bits, by percentages ranging from 1.6% to 99% and has a lower energy consumption, for bus widths greater than or equal to 24-bits, by percentages ranging from 4.8% to 99.4% of the compared competitor designs.
引用
收藏
页码:83 / 91
页数:9
相关论文
共 50 条
  • [41] Efficient Elliptic Curve Point Multiplication Using Digit-Serial Binary Field Operations
    Sutter, Gustavo D.
    Deschamps, Jean-Pierre
    Luis Imana, Jose
    IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS, 2013, 60 (01) : 217 - 225
  • [42] High-throughput hardware-efficient digit-serial architecture for field multiplication over GF(2m)
    Meher, P. K.
    2007 6TH INTERNATIONAL CONFERENCE ON INFORMATION, COMMUNICATIONS & SIGNAL PROCESSING, VOLS 1-4, 2007, : 126 - 130
  • [43] Design space exploration of division over GF(2m) on FPGA:: A digit-serial approach
    Chelton, William
    Benaissa, Mohammed
    2006 13TH IEEE INTERNATIONAL CONFERENCE ON ELECTRONICS, CIRCUITS AND SYSTEMS, VOLS 1-3, 2006, : 172 - 175
  • [44] VLSI generalised digit serial architecture for multiplication, division and square root
    Bashagha, AE
    SIGNAL PROCESSING, 1999, 79 (03) : 261 - 272
  • [45] Scalable and Parameterizable Processor Array Architecture for Similarity Distance Computation
    Kanan, Awos
    Gebali, Fayez
    Ibrahim, Atef
    Li, Kin Fun
    2019 10TH INTERNATIONAL CONFERENCE ON INFORMATION AND COMMUNICATION SYSTEMS (ICICS), 2019, : 245 - 249
  • [46] New digit-serial systolic arrays for power-sum and division operation in GF(2m)
    Lee, WH
    Lee, KJ
    Yoo, KY
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2004, PT 3, 2004, 3045 : 638 - 647
  • [47] A high-throughput fully digit-serial polynomial basis finite field GF(2m) multiplier for IoT applications
    Pillutla, Siva Ramakrishna
    Boppana, Lakshmi
    PROCEEDINGS OF THE 2019 IEEE REGION 10 CONFERENCE (TENCON 2019): TECHNOLOGY, KNOWLEDGE, AND SOCIETY, 2019, : 920 - 924
  • [48] Efficient Scalable Digit-Serial Inverter Over GF(2m) for Ultra-Low Power Devices
    Ibrahim, Atef
    Al-Somani, Turki F.
    Gebali, Fayez
    IEEE ACCESS, 2016, 4 : 9758 - 9763
  • [49] FINITE-FIELD ARITHMETIC ON AN ARRAY PROCESSOR
    REDINBO, GR
    IEEE TRANSACTIONS ON COMPUTERS, 1979, 28 (07) : 461 - 471
  • [50] A comparative cost/performance evaluation of digit-serial multipliers for finite fields of type GF(2n)
    Bertoni, G
    Breveglieri, L
    Fragneto, P
    14TH ANNUAL IEEE INTERNATIONAL ASIC/SOC CONFERENCE, PROCEEDINGS, 2001, : 306 - 310