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 条
  • [41] Low-Complexity Geometric Inter-Prediction for Versatile Video Coding
    Blaeser, Max
    Gao, Han
    Esenlik, Semih
    Alshina, Elena
    Zhao, Zhijie
    Rohlfing, Christian
    Steinbach, Eckehard
    2019 PICTURE CODING SYMPOSIUM (PCS), 2019,
  • [42] Efficient VLSI Implementation of a Sequential Finite Field Multiplier Using Reordered Normal Basis in Domino Logic
    Namin, Parham Hosseinzadeh
    Roma, Crystal
    Muscedere, Roberto
    Ahmadi, Majid
    IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2018, 26 (11) : 2542 - 2552
  • [43] LOW-COMPLEXITY SEPARABLE MULTIPLIER-LESS LOOP FILTER FOR VIDEO CODING
    Saxena, Ankur
    Aabed, Mohammed
    Budagavi, Madhukar
    2015 IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING (ICIP), 2015, : 3715 - 3719
  • [44] DARM: A Low-Complexity and Fast Modular Multiplier for Lattice-Based Cryptography
    Hu, Xiao
    Li, Minghao
    Tian, Jing
    Wang, Zhongfeng
    2021 IEEE 32ND INTERNATIONAL CONFERENCE ON APPLICATION-SPECIFIC SYSTEMS, ARCHITECTURES AND PROCESSORS (ASAP 2021), 2021, : 175 - 178
  • [45] Design and investigation of low-complexity Anurupyena Vedic multiplier for machine learning applications
    Santhosh Kumar Parameswaran
    Gowrishankar Chinnusamy
    Sādhanā, 2020, 45
  • [46] A Deterministic Low-Complexity Approximate (Multiplier-Less) Technique for DCT Computation
    Huang, Junqi
    Kumar, T. Nandha
    Almurib, Haider A. F.
    Lombardi, Fabrizio
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2019, 66 (08) : 3001 - 3014
  • [47] Design and investigation of low-complexity Anurupyena Vedic multiplier for machine learning applications
    Parameswaran, Santhosh Kumar
    Chinnusamy, Gowrishankar
    SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES, 2020, 45 (01):
  • [48] Subquadratic complexity gaussian normal basis multiplier with subquadratic and quadratic computation approach
    Chiou, Che Wun
    Lee, Chiou-Yng
    Sun, Yuh-Sien
    Lee, Cheng-Min
    Chen, Shih Shng
    Lin, Jim-Min
    Chuang, Tai-Pao
    Journal of Computers (Taiwan), 2020, 31 (03) : 11 - 26
  • [49] Low-Complexity MIMO Precoding for Finite-Alphabet Signals
    Wu, Yongpeng
    Ng, Derrick Wing Kwan
    Wen, Chao-Kai
    Schober, Robert
    Lozano, Angel
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2017, 16 (07) : 4571 - 4584
  • [50] Low-complexity precoding for MIMO channels with finite alphabet input
    Cao, Kuo
    Wu, Yongpeng
    Yang, Weiwei
    Cai, Yueming
    Cao, Kuo
    ELECTRONICS LETTERS, 2017, 53 (03) : 160 - 162