A modified Massey-Omura parallel multiplier for a class of finite fields

A Massey-Omura parallel multiplier of finite fields GF(2/sup m/) contains m identical blocks whose inputs are cyclically shifted versions of one another. It is shown that for fields GF(2/sup m/) generated by irreducible all one polynomials, a portion of the block is independent of the input cyclic s...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on computers Vol. 42; no. 10; pp. 1278 - 1280
Main Authors Hasan, M.A., Wang, M.Z., Bhargava, V.K.
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.10.1993
Institute of Electrical and Electronics Engineers
Subjects
Algorithmics. Computability. Computer arithmetics
Application software
Applied sciences
Complexity theory
Computer science; control theory; systems
Cryptography
Digital arithmetic
Error correction
Exact sciences and technology
Galois fields
Polynomials
Redundancy
Telecommunication computing
Theoretical computing
Very large scale integration
Multiplier
Parallel computation
Classification
Online AccessGet full text

Cover

More Information
Summary:A Massey-Omura parallel multiplier of finite fields GF(2/sup m/) contains m identical blocks whose inputs are cyclically shifted versions of one another. It is shown that for fields GF(2/sup m/) generated by irreducible all one polynomials, a portion of the block is independent of the input cyclic shift; hence, the multiplier contains redundancy. By removing the redundancy, a modified parallel multiplier is presented which is modular and has a lower circuit complexity.< >
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9340
1557-9956
DOI:10.1109/12.257715