Novel Mastrovito Multiplier over GF(2m) Using Trinomial
Che Wun Chiou, Jim-Min Lin, Chiou‐Yng Lee, Chi-Ting Ma · 2011
In recent years, mobile communication becomes more and more popular. Thus, information security on electronic commerce is an important issue for mobile communication. The finite field arithmetic operations are applied in modern public-key cryptosystems such as elliptic curve cryptosystem (ECC). In this article, a novel systolic polynomial basis multiplier based on Mastrovito multiplier is presented. The proposed systolic Mastrovito multiplier has low hardware cost by employing reused components. As m=81, the proposed systolic Mastrovito multiplier saves about 50% space complexity as comparing with other similar multipliers.