Low-complexity versatile finite field multiplier in normal basis

被引:2
|
作者
Li, H [1 ]
Zhang, CN
机构
[1] Univ Lethbridge, Dept Math & Comp Sci, Lethbridge, AB T1K 3M4, Canada
[2] Univ Regina, Dept Comp Sci, TRLabs, Regina, SK S4S 0A2, Canada
关键词
finite field multiplication; Massey-Omura multiplier; normal basis; VLSI; encryption;
D O I
10.1155/S111086570220414X
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
A low-complexity VLSI array of versatile multiplier in normal basis over GF(2(n)) is presented. The finite field parameters can be changed according to the user's requirement and make the multiplier reusable in different applications. It increases the flexibility to use the same multiplier for different applications and reduces the user's cost. The proposed multiplier has a regular structure and is very suitable for high speed VLSI implementation. In addition, the pipeline versatile multiplier can be modified to a low-cost architecture which is feasible in embedded systems and restricted computing environments.
引用
收藏
页码:954 / 960
页数:7
相关论文
共 50 条
  • [31] A high speed word level finite field multiplier using reordered normal basis
    Namin, Ashkan Hosseinzadeh
    Wu, Huapeng
    Ahmadi, Majid
    PROCEEDINGS OF 2008 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS 1-10, 2008, : 3278 - 3281
  • [32] Comments on "A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Field"
    Zhou, Gang
    Michalik, Harald
    IEEE TRANSACTIONS ON COMPUTERS, 2010, 59 (07) : 1007 - 1008
  • [33] Low-complexity bit-serial sequential polynomial basis finite field GF(2m) Montgomery multipliers
    Pillutla, Siva Ramakrishna
    Boppana, Lakshmi
    MICROPROCESSORS AND MICROSYSTEMS, 2021, 84
  • [34] A new architecture for a parallel finite field multiplier with low complexity based on composite fields
    Paar, C
    IEEE TRANSACTIONS ON COMPUTERS, 1996, 45 (07) : 856 - 861
  • [36] Low-complexity design of bit-parallel dual-basis multiplier over GF(2m)
    Wang, J. -H.
    Chang, H. W.
    Chiou, C. W.
    Liang, W. -Y.
    IET INFORMATION SECURITY, 2012, 6 (04) : 324 - 328
  • [37] Low-Complexity Bit-Parallel Multiplier over GF(2m) Using Dual Basis Representation
    Chiou-Yng Lee
    Jenn-Shyong Horng
    I-Chang Jou
    Journal of Computer Science and Technology, 2006, 21 : 887 - 892
  • [38] Low-complexity bit-parallel multiplier over GF(2m) using dual basis representation
    Lee, Chiou-Yng
    Horng, Jenn-Shyong
    Jou, I-Chang
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2006, 21 (06) : 887 - 892
  • [39] Multiplexer implementation of low-complexity polynomial basis multiplier in GF(2m) using all one polynomial
    Chiou, Che Wun
    Lee, Chiou-Yng
    Yeh, Yun-Chi
    INFORMATION PROCESSING LETTERS, 2011, 111 (21-22) : 1044 - 1047
  • [40] On complexity of normal basis multiplier using modified Booth's algorithm
    Horng, Jenn-Shyong
    Jou, I-Chang
    Lee, Chiou-Yng
    PROCEEDINGS OF THE 7TH WSEAS INTERNATIONAL CONFERENCE ON APPLIED INFORMATICS AND COMMUNICATIONS, 2007, : 12 - 17