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 条

[41] Low-complexity design of bit-parallel dual-basis multiplier over GF(2m)
Wang, J. -H.
Chang, H. W.
Chiou, C. W.
Liang, W. -Y.
IET INFORMATION SECURITY, 2012, 6 (04) : 324 - 328
[42] Unified parallel Systolic multiplier over GF(2m)
Lee, Chiou-Yng
Chen, Yung-Hui
Chiou, Che-Wun
Lin, Jim-Min
JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2007, 22 (01) : 28 - 38
[43] Reconfigurable implementation of bit-parallel multipliers over GF(2m) for two classes of finite fields
Imaña, JL
2004 IEEE INTERNATIONAL CONFERENCE ON FIELD-PROGRAMMABLE TECHNOLOGY, PROCEEDINGS, 2004, : 287 - 290
[44] Fast and Pipelined Bit-Parallel Montgomery Multiplication and Squaring over GF(2m)
Rashidi, Bahram
Sayedi, Sayed Masoud
Farashahi, Reza Rezaeian
2015 12TH INTERNATIONAL IRANIAN SOCIETY OF CRYPTOLOGY CONFERENCE ON INFORMATION SECURITY AND CRYPTOLOGY (ISCISC), 2015, : 17 - 22
[45] A fast implementation of multiplicative inversion over GF(2m)
Rodríguez-Henríquez, F
Saqib, NA
Cruz-Cortés, N
ITCC 2005: International Conference on Information Technology: Coding and Computing, Vol 1, 2005, : 574 - 579
[46] Hardware implementation of fast division algorithm for GF(2m)
Kang, MS
Lee, KH
8TH INTERNATIONAL CONFERENCE ON ADVANCED COMMUNICATION TECHNOLOGY, VOLS 1-3: TOWARD THE ERA OF UBIQUITOUS NETWORKS AND SOCIETIES, 2006, : U117 - U119
[47] Single error correcting finite field multipliers over GF(2m)
Mathew, J.
Costas, A.
Jabir, A. M.
Rahaman, H.
Pradhan, D. K.
21ST INTERNATIONAL CONFERENCE ON VLSI DESIGN: HELD JOINTLY WITH THE 7TH INTERNATIONAL CONFERENCE ON EMBEDDED SYSTEMS, PROCEEDINGS, 2008, : 33 - +
[48] Performance Analysis of Gaussian Normal Basis GF (2m) Serial Multipliers and Inverters
Puligunta, Mahidhar
El-Razouk, Hayssam
2021 IEEE 11TH ANNUAL COMPUTING AND COMMUNICATION WORKSHOP AND CONFERENCE (CCWC), 2021, : 738 - 746
[49] Fast Parallel GF(2m) Polynomial Multiplication for All Degrees
Cilardo, Alessandro
IEEE TRANSACTIONS ON COMPUTERS, 2013, 62 (05) : 929 - 943
[50] Design of multipliers for GF(2m) (vol 46, pg 419, 2010)
Mao, Z.
Shou, G.
Hu, Y.
Guo, Z.
ELECTRONICS LETTERS, 2010, 46 (25) : 1702 - 1702

← 1 2 3 4 5 →