Efficient Bit-Serial Finite Field Montgomery Multiplier in GF(2m)

被引：0
|
作者：
Wu, Huapeng [1 ]
机构：
[1] Univ Windsor, Dept ECE, Windsor, ON N9B 3P4, Canada
来源：
2014 4TH IEEE INTERNATIONAL CONFERENCE ON INFORMATION SCIENCE AND TECHNOLOGY (ICIST) | 2014年
关键词：
Montgomery multiplication; Finite field; Linear feedback shift register (LFSR); Weakly dual basis;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Montgomery multiplication in finite fields has been paid more and more attention recently since it shows advantageous over regular multiplication in speeding up elliptic curve cryptography based network security protocols. In this paper, a most-significant-bit first bit-serial Montgomery multiplication algorithm in GF(2(m)) using weakly dual bases is proposed for the first time. Then a new bit-serial Montgomery multiplier architecture is proposed using a linear feedback shift register (LFSR). Complexity comparison has shown that the proposed multiplier is comparable to or has certain advantage over the best among the existing similar works found in the literature.
引用
收藏
页码：527 / 530
页数：4
相关论文
共 50 条
  • [21] Bit-serial AOP arithmetic architectures over GF(2m)
    Kim, HS
    Yoo, KY
    INFRASTRUCTURE SECURITY, PROCEEDINGS, 2002, 2437 : 303 - 313
  • [22] Montgomery multiplier and squarer in GF(2m)
    Wu, HP
    CRYPTOGRAPHIC HARDWARE AND EMBEDDED SYSTEMS-CHES 2000, PROCEEDINGS, 2001, 1965 : 264 - 276
  • [23] A new reconfigurable bit-serial systolic divider for GF(2M) and GF(P).
    Cohen, AE
    Parhi, KK
    2005 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOLS 1-5: SPEECH PROCESSING, 2005, : 105 - 108
  • [24] Efficient bit serial multiplication in GF(2m) for a class of finite fields
    Kwon, S
    Ryu, H
    INFORMATION NETWORKING: NETWORKING TECHNOLOGIES FOR ENHANCED INTERNET SERVICES, 2003, 2662 : 762 - 771
  • [25] A novel approach for bit-serial AB2 multiplication in finite fields GF(2m)
    Jeon, Jun-Cheol
    Kim, Kee-Won
    Yoo, Kee-Young
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2006, 51 (6-7) : 1103 - 1112
  • [26] An efficient digit-serial systolic multiplier for finite fields GF(2m)
    Kim, CH
    Han, SD
    Hong, CP
    14TH ANNUAL IEEE INTERNATIONAL ASIC/SOC CONFERENCE, PROCEEDINGS, 2001, : 361 - 365
  • [27] Low Latency Systolic Montgomery Multiplier for Finite Field GF(2m) Based on Pentanomials
    Xie, Jiafeng
    He, Jian Jun
    Meher, Pramod Kumar
    IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2013, 21 (02) : 385 - 389
  • [28] Efficient digit-serial systolic multiplier for finite fields GF(2m)
    Kim, KW
    Lee, KJ
    Yoo, KY
    COMPUTER APPLICATIONS IN INDUSTRY AND ENGINEERING, 2001, : 205 - 208
  • [29] On-line error detection for bit-serial multipliers in GF(2m)
    Fenn, S
    Gossel, M
    Benaissa, M
    Taylor, D
    JOURNAL OF ELECTRONIC TESTING-THEORY AND APPLICATIONS, 1998, 13 (01): : 29 - 40
  • [30] Unified digit-serial multiplier/inverter in finite field GF(2m)
    Fan, Junfeng
    Verbauwhede, Ingrid
    2008 IEEE INTERNATIONAL WORKSHOP ON HARDWARE-ORIENTED SECURITY AND TRUST, 2008, : 72 - 75
12345