Regular Section
An Efficient Exponentiation Algorithm in GF(2m) Using Euclidean Inversion
2022 Volume E105.A Issue 9 Pages 1381-1384
Details
2022 Volume E105.A Issue 9 Pages 1381-1384
We introduce a new type of exponentiation algorithm in GF(2m) using Euclidean inversion. Our approach is based on the fact that Euclidean inversion cost much less logic gates than ordinary multiplication in GF(2m). By applying signed binary form of the exponent instead of classic binary form, the proposed algorithm can reduce the number of operations further compared with the classic algorithms.