Low-complexity bit-parallel systolic multipliers over GF(2m)

被引：3
|
作者：
Chiou-Yng Lee
Chin-Chin Chen
Yuan-Ho Chen
Erl-Huei Lu
机构：
来源：
2006 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-6, PROCEEDINGS | 2006年
关键词：
systolic array; folded technique; primitive polynomial; interleaved conventional multiplication;
D O I：
10.1109/ICSMC.2006.384557
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Recently, cryptographic applications based on finite fields have attracted much interest. This paper presents two new algorithms, called time-dependent and time-independent multiplication algorithms over a finite field GF(2(m)) by employing an interleaved conventional multiplication and a folded technique. The proposed algorithms permit efficient realization of the bit-parallel multiplication using iterative arrays. The results show that our proposed time-dependent and time-independent multipliers save about 38% and 54% space complexity as compared to the traditional multipliers, respectively.
引用
收藏
页码：1160 / 1165
页数：6
相关论文
共 50 条
  • [21] Derivation of reduced test vectors for bit-parallel multipliers over GF(2m)
    Rahaman, H.
    Mathew, J.
    Pradhan, D. K.
    Jabir, A. M.
    IEEE TRANSACTIONS ON COMPUTERS, 2008, 57 (09) : 1289 - 1294
  • [22] Low complexity bit-parallel systolic architecture for computing C+AB2 over a class of GF(2m)
    Ting, YR
    Lu, EH
    Lee, JY
    INTEGRATION-THE VLSI JOURNAL, 2004, 37 (03) : 167 - 176
  • [23] Low-complexity bit-parallel systolic architecture for computing AB2+C in a class of finite field GF(2m)
    Lee, CY
    Lu, EH
    Sun, LF
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-ANALOG AND DIGITAL SIGNAL PROCESSING, 2001, 48 (05): : 519 - 523
  • [24] Low complexity bit-parallel multipliers for GF(2m) with generator polynomial xm+xk+1
    Elia, M
    Leone, M
    Visentin, C
    ELECTRONICS LETTERS, 1999, 35 (07) : 551 - 552
  • [25] A systolic bit-parallel multiplier with flexible latency and complexity over GF(2m) using polynomial basis
    Zhang, Jingxian
    Song, Zheng
    Hu, Qingsheng
    ADVANCED MATERIALS AND ENGINEERING MATERIALS, PTS 1 AND 2, 2012, 457-458 : 848 - 855
  • [26] Efficient bit-parallel systolic architecture for multiplication and squaring over GF(2m)
    Kim, Kee-Won
    Kim, Seung-Hoon
    IEICE ELECTRONICS EXPRESS, 2018, 15 (02):
  • [27] Low-complexity parallel systolic Montgomery multipliers over GF(2m) using Toeplitz matrix-vector representation
    Lee, Chiou-Yng
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2008, E91A (06) : 1470 - 1477
  • [28] High Speed Bit-Parallel Systolic Multiplier over GF (2m) for Cryptographic Application
    Sargunam, B.
    Mozhi, S. Arul
    Dhanasekaran, R.
    2012 IEEE INTERNATIONAL CONFERENCE ON ADVANCED COMMUNICATION CONTROL AND COMPUTING TECHNOLOGIES (ICACCCT), 2012, : 244 - 247
  • [29] Compact bit-parallel systolic montgomery multiplication over GF(2m) generated by trinomials
    Lee, Chiou-Yng
    Chen, Chin-Chin
    Lu, Erl-Huei
    TENCON 2006 - 2006 IEEE REGION 10 CONFERENCE, VOLS 1-4, 2006, : 259 - 262
  • [30] Low complexity bit serial systolic multipliers over GF(2m) for three classes of finite fields
    Kwon, S
    INFORMATION AND COMMUNICATIONS SECURITY, PROCEEDINGS, 2002, 2513 : 209 - 216
12345