A modified Massey-Omura parallel multiplier for a class of finite fields
Authors:
- M.A. HasanMHM.A. Hasan
- M.Z. WangMWM.Z. Wang
- V.K. BhargavaVBV.K. Bhargava
- 1 January 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 42 (10) , 1278-1280
Abstract
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.Keywords
This publication has 6 references indexed in Scilit:
- Modular construction of low complexity parallel multipliers for a class of finite fields GF(2/sup m/)IEEE Transactions on Computers, 1992
- Low complexity normal basesDiscrete Applied Mathematics, 1989
- Structure of parallel multipliers for a class of fields GF(2m)Information and Computation, 1989
- VLSI Architectures for Computing Multiplications and Inverses in GF(2m)IEEE Transactions on Computers, 1985
- New directions in cryptographyIEEE Transactions on Information Theory, 1976
- The use of finite fields to compute convolutionsIEEE Transactions on Information Theory, 1975