Low complexity architecture of bit parallel multipliers for GF(2m)

Low complexity architecture of bit parallel multipliers for GF(2m)

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

A new architecture of multipliers for GF(2m) which accomplishes multiplication by lower-dimensional multiplication is proposed. The space complexity of the new multipliers is about 1/2 (1+1/r) of the ordinary ones, and it only needs two or three more XOR gate delays.


    1. 1)
      • S.A. Vanstone , P.C. Oorschot . (1989) An introduction to error correcting codes with applications.
    2. 2)
      • R. Lidl , H. Niederreiter . (1994) Introduction to finite fields and their applications.
    3. 3)
    4. 4)
    5. 5)
      • H. Wu . Bit-parallel polynomial basis multiplier for new classes of finite fields. IEEE Trans. Comput. , 8 , 1023 - 1031
    6. 6)
      • Z. Mao , G. Shou , Y. Hu , Z. Gang . Design of multipliers on GF(2m). Electron. Lett. , 6 , 419 - 420

Related content

This is a required field
Please enter a valid email address