On the inherent space complexity of fast parallel multipliers for GF(2m)

被引：12
|
作者：
Elia, M
Leone, M
机构：
[1] Politecn Torino, Dipartimento Elettron, I-10129 Turin, Italy
[2] TILAB Telecom Italia Lab, I-10148 Turin, Italy
来源：
IEEE TRANSACTIONS ON COMPUTERS | 2002年 / 51卷 / 03期
关键词：
finite fields; parallel multiplier; optimal normal basis;
D O I：
10.1109/12.990131
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
A lower bound to the number of AND gates used in parallel multipliers for GF((2M)) under the condition that time complexity be minimum, is determined, In particular, the exact minimum number of AND gates for Primitive Normal Bases and Optimal Normal Bases of Type 11 multipliers is evaluated, This result indirectly suggests that space complexity is essentially a quadratic function of m when time complexity is kept minimum.
引用
收藏
页码：346 / 351
页数：6
相关论文
共 50 条
  • [31] Fast Inversion in GF(2m) with Normal Basis Using Hybrid-Double Multipliers
    Azarderakhsh, Reza
    Jarvinen, Kimmo
    Dimitrov, Vassil
    IEEE TRANSACTIONS ON COMPUTERS, 2014, 63 (04) : 1041 - 1047
  • [32] 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
  • [33] Scalable and systolic Montgomery multipliers over GF(2m)
    Chen, Chin-Chin
    Lee, Chiou-Yng
    Lu, Erl-Huei
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2008, E91A (07) : 1763 - 1771
  • [34] High speed Galois fields GF(2m) multipliers
    Petra, Nicola
    De Caro, Davide
    Strollo, Antonio G. M.
    2007 EUROPEAN CONFERENCE ON CIRCUIT THEORY AND DESIGN, VOLS 1-3, 2007, : 468 - 471
  • [35] SYSTOLIC MULTIPLIERS FOR FINITE-FIELDS GF(2M)
    YEH, CS
    REED, IS
    TRUONG, TK
    IEEE TRANSACTIONS ON COMPUTERS, 1984, 33 (04) : 357 - 360
  • [36] FAST VLSI MULTIPLIER FOR GF(2M ).
    Scott, P.Andrew
    Tavares, Stafford E.
    Peppard, Lloyd E.
    IEEE Journal on Selected Areas in Communications, 1984, SAC-4 (01) : 62 - 66
  • [37] A FAST VLSI MULTIPLIER FOR GF(2M)
    SCOTT, PA
    TAVARES, SE
    PEPPARD, LE
    IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1986, 4 (01) : 62 - 66
  • [38] The design of a low-complexity systolic architecture for fast bit-parallel exponentiation in a class of GF(2m)
    Lee, CY
    Lu, EH
    Sun, LF
    2000 5TH INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING PROCEEDINGS, VOLS I-III, 2000, : 598 - 605
  • [39] Low Complexity Implementation of Unified Systolic Multipliers for NIST Pentanomials and Trinomials Over GF(2m)
    Shao, Qiliang
    Hu, Zhenji
    Basha, Shaik Nazeem
    Zhang, Zhiping
    Wu, Zhiqiang
    Lee, Chiou-Yng
    Xie, Jiafeng
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2018, 65 (08) : 2455 - 2465
  • [40] Parallel in/out systolic AB2 architecture with low complexity in GF(2m)
    Choi, S-H.
    Lee, K-J.
    ELECTRONICS LETTERS, 2016, 52 (13) : 1138 - 1139
12345