Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
