Issue No. 10 - October (2004 vol. 53)
ISSN: 0018-9340
pp: 1231-1243
Berk Sunar , IEEE
ABSTRACT
We introduce a new tower field representation, optimal tower fields (OTFs), that facilitates efficient finite field operations. The recursive direct inversion method we present has significantly lower complexity than the known best method for inversion in optimal extension fields (OEFs), i.e., Itoh-Tsujii's inversion technique. The complexity of our inversion algorithm is shown to be O(m^2), significantly better than that of the Itoh-Tsujii algorithm, i.e., O(m^2(\log_2m)). This complexity is further improved to O(m^{\log_23}) by utilizing the Karatsuba-Ofman algorithm. In addition, we show that OTFs may be converted to OEF representation via a simple permutation of the coefficients and, hence, OTF operations may be utilized to achieve the OEF arithmetic operations whenever a corresponding OTF representation exists. While the original OTF multiplication and squaring operations require slightly more additions than their OEF counterparts, due to the free conversion, both OTF operations may be achieved with the complexity of OEF operations.
INDEX TERMS
Optimal tower fields, OEF, finite fields, multiplication, inversion, elliptic curve cryptography.
CITATION

B. Sunar and S. Baktir, "Optimal Tower Fields," in IEEE Transactions on Computers, vol. 53, no. , pp. 1231-1243, 2004.
doi:10.1109/TC.2004.83