Title :
A modified Massey-Omura parallel multiplier for a class of finite fields
Author :
Hasan, M. Anwar ; Wang, M.Z. ; Bhargava, V.K.
Author_Institution :
Victoria Univ., BC, Canada
fDate :
10/1/1993 12:00:00 AM
Abstract :
A Massey-Omura parallel multiplier of finite fields GF(2m ) contains m identical blocks whose inputs are cyclically shifted versions of one another. It is shown that for fields GF(2m) 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 :
digital arithmetic; multiplying circuits; polynomials; Massey-Omura parallel multiplier; cyclically shifted versions; finite fields; input cyclic shift; lower circuit complexity; polynomials; redundancy; Application software; Complexity theory; Cryptography; Digital arithmetic; Error correction; Galois fields; Polynomials; Redundancy; Telecommunication computing; Very large scale integration;
Journal_Title :
Computers, IEEE Transactions on
