A basis-independent algorithm to design fast parallel multipliers over GF(2m)

被引：1

作者：

Elia, M ^{[1
]}

Leone, M ^{[1
]}

机构：

[1] Politecn Torino, I-10129 Turin, Italy

来源：

ITCC 2004: INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY: CODING AND COMPUTING, VOL 2, PROCEEDINGS | 2004年

关键词：

D O I：

10.1109/ITCC.2004.1286712

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

This paper presents a general algorithm to design fast parallel multipliers in any basis over GF(2(m)), avoiding any basis-dependent procedure or "ad hoc" optimization, as usually proposed in literature. Although the total number of gates is not guaranteed to be the absolute minimum, the algorithm is aimed at minimizing the number of XOR gates, reaching the minimum for the AND gate number For the sake of comparison, lower and upper bounds to space and time complexities have been explicitly evaluated. As a significant example, for several m of practical interest, the algorithm has been applied to Gaussian Normal Basis parallel multipliers.

引用

页码：553 / 559

页数：7

共 50 条

[21] Ringed bit-parallel systolic multipliers over a class of fields GF(2m)
Ting, YR
Lu, EH
Lu, YC
INTEGRATION-THE VLSI JOURNAL, 2005, 38 (04) : 571 - 578
[22] Low-complexity bit-parallel systolic multipliers over GF(2m)
Lee, Chiou-Yng
INTEGRATION-THE VLSI JOURNAL, 2008, 41 (01) : 106 - 112
[23] Division algorithm over GF(2m)
Popovici, EM
Fitzpatrick, P
ELECTRONICS LETTERS, 1998, 34 (19) : 1843 - 1844
[24] Easily testable implementation for bit parallel multipliers in GF (2m)
Rahaman, H.
Mathew, J.
Jabir, A. M.
Pradhan, D. K.
HLDVT'06: ELEVENTH ANNUAL IEEE INTERNATIONAL HIGH-LEVEL DESIGN VALIDATION AND TEST WORKSHOP, PROCEEDINGS, 2006, : 48 - +
[25] Fast Bit-Parallel Shifted Polynomial Basis Multiplier Using Weakly Dual Basis Over GF(2m)
Park, Sun-Mi
Chang, Ku-Young
IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2011, 19 (12) : 2317 - 2321
[26] Low complexity architecture of bit parallel multipliers for GF(2m)
Shou, G.
Mao, Z.
Hu, Y.
Guo, Z.
Qian, Z.
ELECTRONICS LETTERS, 2010, 46 (19) : 1326 - 1327
[27] Reconfigurable implementation of GF(2m) bit-parallel multipliers
Imana, Jose L.
PROCEEDINGS OF THE 2018 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION (DATE), 2018, : 893 - 896
[28] Polynomial Basis Multiplication over GF(2m)
Serdar S. Erdem
Tuğrul Yanık
Çetin K. Koç
Acta Applicandae Mathematica, 2006, 93 : 33 - 55
[29] Constant function independent test set for fault detection in bit parallel multipliers in GF(2m)
Rahaman, H.
Mathew, J.
Pradhan, D. K.
20TH INTERNATIONAL CONFERENCE ON VLSI DESIGN, PROCEEDINGS: TECHNOLOGY CHALLENGES IN THE NANOELECTRONICS ERA, 2007, : 479 - 484
[30] ALGORITHM FOR SQUARING IN GF(2M) IN STANDARD BASIS
PIONTAS, M
ELECTRONICS LETTERS, 1989, 25 (18) : 1262 - 1263

← 1 2 3 4 5 →