Low-complexity modified mastrovito multipliers over finite fields GF(2M)

Leilei Song, Keshab K Parhi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

12 Scopus citations

Abstract

This paper considers the design of low-complexity dedicated finite field multipliers. A modified Mastrovito multiplication scheme is proposed in this paper, which has a complexity proportional to (m - 1 - pwt), where pwt is the Hamming weight of the underlying irreducible polynomial. With this modified multiplier and the original Mastrovito multiplier, low-complexity parallel multipliers for finite fields GF(2M) can be designed with complexity proportional to min {pwt, m - 1 - pwt}, hence are good for irreducible polynomials of both low and high Hamming weights. This completes the design space and offers more freedom on polynomial selection. It is shown that this generalized Mastrovito multiplier generally has the lowest complexity, smallest latency and consumes the least power, compared with other standard-basis and dual-basis multipliers.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE International Symposium on Circuits and Systems
PublisherIEEE
Volume1
ISBN (Print)0780354729
StatePublished - Jan 1 1999
EventProceedings of the 1999 IEEE International Symposium on Circuits and Systems, ISCAS '99 - Orlando, FL, USA
Duration: May 30 1999Jun 2 1999

Other

OtherProceedings of the 1999 IEEE International Symposium on Circuits and Systems, ISCAS '99
CityOrlando, FL, USA
Period5/30/996/2/99

Fingerprint Dive into the research topics of 'Low-complexity modified mastrovito multipliers over finite fields GF(2M)'. Together they form a unique fingerprint.

  • Cite this

    Song, L., & Parhi, K. K. (1999). Low-complexity modified mastrovito multipliers over finite fields GF(2M). In Proceedings - IEEE International Symposium on Circuits and Systems (Vol. 1). IEEE.