Low Complexity Architecture for Multiplicative Inversion in GF(2m)
Ming-Haw Jing, Jianhong Chen, Zih-Heng Chen, Yan-Haw Chen · 2006
The multiplicative inversion in finite field is much more complex than all field arithmetic operations. In this paper, a design of a simpler inversion module with lower complexity in GF(2m) using standard basis is proposed. It has the major improvement comparing with the design proposed by Wang et al. and Dinh et al. The implementations of those algorithms are examined in detail using 0.18-mum CMOS technology. The proposed method results in reduction of area requirement by 28% to 48% when m is between 3 and 12