Multiplexer implementation of low-complexity polynomial basis multiplier in GF(m2)GF(2m) using all one polynomial

Polynomial basis multipliers are realized by conventional AND and XOR gates. In this study, polynomial basis multiplier is implemented by multiplexers rather than traditional AND and XOR gates. Two bits are processed at the same time. The proposed multiplexer-based multiplier saves about 14% space complexity as compared to other existing multipliers. Furthermore, the proposed multiplier also saves about 37% time complexity (for example, m=156m=156) while comparing with other existing multipliers.

► Polynomial basis multiplier is implemented by multiplexers. ► Two bits in the proposed multiplier are processed at the same time. ► The proposed multiplexer-based multiplier saves both space and time complexities.