Bit-parallel polynomial basis multiplier for new classes of finite fields

被引：19
|
作者：
Wu, Huapeng [1 ]
机构：
[1] Univ Windsor, Dept Elect & Comp Engn, Windsor, ON N9B 3P4, Canada
来源：
IEEE TRANSACTIONS ON COMPUTERS | 2008年 / 57卷 / 08期
基金：
加拿大自然科学与工程研究理事会;
关键词：
finite fields arithmetic; hardware architecture; polynomial basis; irreducible polynomial;
D O I：
10.1109/TC.2008.67
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper, three small classes of finite fields GF(2(m)) are found for which low-complexity bit-parallel multipliers are proposed. The proposed multipliers have lower complexities compared to those based on the irreducible pentanomials. It is also shown that there does not always exist an irreducible all-one polynomial, equally spaced polynomial, or trinomial for the new classes of fields.
引用
收藏
页码：1023 / 1031
页数：9
相关论文
共 50 条
  • [1] Bit-parallel finite field multiplier and squarer using polynomial basis
    Wu, HP
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 2002, 51 (07) : 750 - 758
  • [2] New efficient bit-parallel polynomial basis multiplier for special pentanomials
    Park, Sun-Mi
    Chang, Ku-Young
    Hong, Dowon
    Seo, Changho
    [J]. INTEGRATION-THE VLSI JOURNAL, 2014, 47 (01) : 130 - 139
  • [3] Efficient Implementation of Low Time Complexity and Pipelined Bit-Parallel Polynomial Basis Multiplier over Binary Finite Fields
    Rashidi, Bahram
    Farashahi, Reza Rezaeian
    Sayedi, Sayed Masoud
    [J]. ISECURE-ISC INTERNATIONAL JOURNAL OF INFORMATION SECURITY, 2015, 7 (02): : 101 - 114
  • [4] Low complexity bit-parallel multiplier for a class of finite fields
    Wu, Huapeng
    [J]. 2006 INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CIRCUITS AND SYSTEMS PROCEEDINGS, VOLS 1-4: VOL 1: SIGNAL PROCESSING, 2006, : 2565 - 2568
  • [5] Efficient bit-parallel multiplier for irreducible pentanomials using a shifted polynomial basis
    Park, Sun-Mi
    Chang, Ku-Young
    Hong, Dowon
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 2006, 55 (09) : 1211 - 1215
  • [6] Low complexity bit-parallel finite field arithmetic using polynomial basis
    Wu, HP
    [J]. CRYPTOGRAPHIC HARDWARE AND EMBEDDED SYSTEMS, 1999, 1717 : 280 - 291
  • [7] Fault-Tolerant Bit-Parallel Multiplier for Polynomial Basis of GF(2m)
    Lee, Chiou-Yng
    Lee, Wen-Yo
    Meher, Pramod Kumar
    [J]. IEEE CIRCUITS AND SYSTEMS INTERNATIONAL CONFERENCE ON TESTING AND DIAGNOSIS, 2009, : 403 - +
  • [8] A Bit-Parallel Deterministic Stochastic Multiplier
    Vatsavai, Sairam Sri
    Thakkar, Ishan
    [J]. 2023 24TH INTERNATIONAL SYMPOSIUM ON QUALITY ELECTRONIC DESIGN, ISQED, 2023, : 374 - 374
  • [9] Fast Bit-Parallel Polynomial Basis Multiplier for GF(2m) Defined by Pentanomials Using Weakly Dual Basis
    Park, Sun-Mi
    Chang, Ku-Young
    Hong, Dowon
    Seo, Changho
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2013, E96A (01) : 322 - 331
  • [10] Fast Bit-Parallel Shifted Polynomial Basis Multiplier Using Weakly Dual Basis Over GF(2m)
    Park, Sun-Mi
    Chang, Ku-Young
    [J]. IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2011, 19 (12) : 2317 - 2321
12345