Design of multipliers for GF(2m)

Design of 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 design of multipliers for GF(2m) based on combination of bit-serial and bit-parallel schemes with low complexity is proposed. Using pipeline architecture, the scheme yields significantly lower latency compared to known bit-parallel multipliers for GF(2m).


    1. 1)
      • S.A. Vanstone , P.C. Oorschot . (1989) An introduction to error correcting codes with applications.
    2. 2)
      • Mastrovito, E.D.: `‘VLSI designs for multiplication over finite field, GF(2', Proc. Sixth Int'l Conf., (AAECC-6), July 1988, Rome, Italy, p. 297–309.
    3. 3)
      • R. Lidl , H. Niederreiter . (1994) Introduction to finite fields and their applications.
    4. 4)
    5. 5)
    6. 6)
      • P.K. Meher . Systolic and super-systolic multipliers for finite field. GF(2m) based on irreducible trinomials. IEEE Trans. Circuits Syst. , 4 , 1031 - 1040
    7. 7)
    8. 8)
      • C.Y. Lee . Low complexity bit-parallel systolic multiplier over GF(2m) using irreducible trinomials. IEEE Proc., Comput. Digit. Tech. , 1 , 39 - 42
    9. 9)
    10. 10)
    11. 11)
    12. 12)
    13. 13)

Related content

An Erratum has been published for this content:
Erratum for ‘Design of multipliers for GF(2m)’
This is a required field
Please enter a valid email address