Multiplexer implementation of low-complexity polynomial basis multiplier in GF(2m) using all one polynomial

被引：4

作者：

Chiou, Che Wun ^{[1
]}

Lee, Chiou-Yng ^{[2
]}

Yeh, Yun-Chi ^{[3
]}

机构：

[1] Ching Yun Univ, Dept Comp Sci & Informat Engn, Chungli 320, Taiwan

[2] Lunghwa Univ Sci & Technol, Dept Comp Informat & Network Engn, Tao Yuan 333, Taiwan

[3] Ching Yun Univ, Dept Elect Engn, Jhongli 320, Taiwan

来源：

INFORMATION PROCESSING LETTERS | 2011年 / 111卷 / 21-22期

关键词：

Multiplier; Cryptography; Multiplexer; Finite field; Polynomial basis; FINITE-FIELD MULTIPLIER; PARALLEL MULTIPLIERS; CONSTRUCTION;

D O I：

10.1016/j.ipl.2011.08.004

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Polynomial basis multipliers are realized by conventional AND and XOR gates. In this study, polynomial basis multiplier is implemented by multiplexers rather than traditional AND and XOR gates. Two bits are processed at the same time. The proposed multiplexer-based multiplier saves about 14% space complexity as compared to other existing multipliers. Furthermore, the proposed multiplier also saves about 37% time complexity (for example, m = 156) while comparing with other existing multipliers. (C) 2011 Elsevier B.V. All rights reserved.

引用

页码：1044 / 1047

页数：4

共 50 条

[31] 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
[32] Novel bit-parallel multiplier for GF(2m) defined by all-one polynomial using generalized Karatsuba algorithm
Xie, Xiao-ning
Chen, Gong-liang
Li, Yin
INFORMATION PROCESSING LETTERS, 2014, 114 (03) : 140 - 146
[33] POLYNOMIAL FACTORIZATION IN GF(2M)
BOUTROS, YZ
FIANI, GP
LOOKA, ES
ENGINEERING FRACTURE MECHANICS, 1994, 47 (03) : 451 - 455
[34] Low area-time complexity point multiplication architecture for ECC over GF(2m) using polynomial basis
Nadikuda, Pradeep Kumar Goud
Boppana, Lakshmi
JOURNAL OF CRYPTOGRAPHIC ENGINEERING, 2023, 13 (01) : 107 - 123
[35] Computation of AB2 multiplier in GF(2m) using efficient low-complexity cellular architecture
Liu, CH
Huang, NF
Lee, CY
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2000, E83A (12) : 2657 - 2663
[36] LFSR multipliers over GF(2m) defined by all-one polynomial
Kim, Hyun-Sung
Lee, Sung-Woon
INTEGRATION-THE VLSI JOURNAL, 2007, 40 (04) : 473 - 478
[37] Parallel Algorithm for Polynomial Basis Multiplier in GF(2(m)) Fields
Chiou, Che-Wun
Jeng, Huey-Lin
JOURNAL OF APPLIED SCIENCE AND ENGINEERING, 2008, 11 (02): : 211 - 218
[38] A new construction of the irreducible polynomial for parallel multiplier over GF(2m)
Hwang, JH
Moon, KJ
Park, SY
Kim, HS
33RD INTERNATIONAL SYMPOSIUM ON MULTIPLE-VALUED LOGIC, PROCEEDINGS, 2003, : 24 - 29
[39] A new construction of the irreducible polynomial for parallel multiplier over GF(2m)
Hwang, J.-H. (jhhwang@sports.re.kr), 1600, IEEE Computer Soc. Techn. Comm. on Multiple-Valued Logic; Japanese Research Group on Multiple-Valued Logic; Meiji University (Institute of Electrical and Electronics Engineers Computer Society):
[40] An efficient polynomial multiplier in GF(2m) and its application to ECC designs
Peter, Steffen
Langendoerfer, Peter
2007 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION, VOLS 1-3, 2007, : 1253 - 1258

← 1 2 3 4 5 →