VLSI ARCHITECTURES FOR COMPUTING MULTIPLICATIONS AND INVERSES IN GF(2M).

被引：223

作者：

Wang, Charles C. ^{[1
]}

Truong, T.K. ^{[1
]}

Shao, Howard M. ^{[1
]}

Deutsch, Leslie J. ^{[1
]}

Omura, Jim K. ^{[1
]}

Reed, Irving S. ^{[1
]}

机构：

[1] JPL, Pasadena, CA, USA, JPL, Pasadena, CA, USA

来源：

IEEE Transactions on Computers | 1985年 / C-34卷 / 08期

关键词：

CODES; SYMBOLIC; -; Encoding; COMPUTERS; MICROCOMPUTER - Multiplying Circuits - CRYPTOGRAPHY;

D O I：

10.1109/TC.1985.1676616

中图分类号：

学科分类号：

摘要：

Finite field arithmetic logic is central in the implementation of Reed-Solomon coders and in some cryptographic algorithms. There is a need for good multiplication and inversion algorithms that can be easily realized on VLSI chips. J. L. Massey and J. K. Omura recently (1981) developed a new multiplication algorithm for Galois fields based on a normal basis representation. A pipeline structure is developed to realize the Massey-Omura multiplier in the finite field GF(2**m ). With the simple squaring property of the normal basis representation used together with this multiplier, a pipeline architecture is also developed for computing inverse elements in GF(2**m ). The designs developed for the Massey-Omura multiplier and the computation of inverse elements are regular, simple, expandable, and, therefore, naturally suitable for VLSI implementation. 12 refs.

引用

页码：709 / 717

共 50 条

[41] Improved VLSI designs for multiplication and inversion in GF(2M) over normal bases
Gao, LJ
Sobelman, GE
13TH ANNUAL IEEE INTERNATIONAL ASIC/SOC CONFERENCE, PROCEEDINGS, 2000, : 97 - 101
[42] High-speed VLSI design for montgomery inverse over GF(2m)
Chen, JH
Shieh, MD
Wu, CM
PROCEEDINGS OF THE 2004 IEEE ASIA-PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS, VOL 1 AND 2: SOC DESIGN FOR UBIQUITOUS INFORMATION TECHNOLOGY, 2004, : 25 - 28
[43] A SYSTOLIC ARCHITECTURE FOR COMPUTING INVERSES AND DIVISIONS IN FINITE-FIELDS GF(2(M))
WANG, CL
LIN, JL
IEEE TRANSACTIONS ON COMPUTERS, 1993, 42 (09) : 1141 - 1146
[44] Scalable and systolic architecture for computing double exponentiation over GF(2m)
Lee, Chiou-Yng
Lin, Jim-Min
Chiou, Che Wun
ACTA APPLICANDAE MATHEMATICAE, 2006, 93 (1-3) : 161 - 178
[45] Scalable and Systolic Architecture for Computing Double Exponentiation Over GF(2m)
Chiou-Yng Lee
Jim-Min Lin
Che Wun Chiou
Acta Applicandae Mathematica, 2006, 93 : 161 - 178
[46] A Low-Delay Common Subexpression Elimination Algorithm for Constant Matrix Multiplications over GF(2m)
Zhang, Xiaoqiang
Wu, Ning
Lan, Lidong
Liu, Yaoping
PROCEEDINGS OF THE 2015 10TH IEEE CONFERENCE ON INDUSTRIAL ELECTRONICS AND APPLICATIONS, 2015, : 416 - 421
[47] Systolic architectures for inversion/division using AB2 circuits in GF(2m)
Kim, NY
Yoo, KY
INTEGRATION-THE VLSI JOURNAL, 2003, 35 (01) : 11 - 24
[48] POLYNOMIAL FACTORIZATION IN GF(2M)
BOUTROS, YZ
FIANI, GP
LOOKA, ES
ENGINEERING FRACTURE MECHANICS, 1994, 47 (03) : 451 - 455
[49] VLSI architectures for multiplication in GF(2(m)) for application tailored digital signal processors
Drescher, W
Fettweis, G
VLSI SIGNAL PROCESSING, IX, 1996, : 55 - 64
[50] DIVISION OVER GF(2M)
FENN, STJ
TAYLOR, D
BENAISSA, M
ELECTRONICS LETTERS, 1992, 28 (24) : 2259 - 2261

← 1 2 3 4 5 →