Efficient squarer for Type C.2 pentanomial

Efficient squarer for Type C.2 pentanomial

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.

In recent years, two new types of irreducible pentanomials, i.e. Type C.1 and Type C.2 pentanomials, and their associated generalised polynomials bases (GPBs) have been proposed to yield efficient bit-parallel multiplier architectures. The GPB squarer for Type C.1 pentanomial is also investigated previously. But no GPB squarer for Type C.2 pentanomial is given as these pentanomials are far more complicated. In this Letter, the authors give explicit GPB squarer formulae for all Type C.2 pentanomials by re-classifying these pentanomials into certain sub-groups, which is based on the parities of pentanomial parameters. As the main contribution of this Letter, the authors show that the GPB squarers for most Type C.2 pentanomials match the fastest results.


    1. 1)
      • 1. Menezes, A.J., Blake, I.F., Gao, X., et al: ‘Applications of finite fields’ (Kluwer Academic, Norwell, Massachusetts, USA, 1993).
    2. 2)
    3. 3)
      • 3. Wu, H.: ‘Montgomery multiplier and squarer for a class of finite fields’, Trans. Comput., 2003, 51, (5), pp. 521529.
    4. 4)
    5. 5)
    6. 6)
    7. 7)

Related content

This is a required field
Please enter a valid email address