access icon free Efficient squarer for Type C.2 pentanomial

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.

Inspec keywords: polynomials

Other keywords: generalised polynomials bases; GF(2m) squarer; type C.2 pentanomial; GPB squarers

Subjects: Algebra; Algebra; Algebra; Algebra, set theory, and graph theory

References

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

Related content

content/journals/10.1049/el.2017.4813
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading