Publication 2004 Issue No. 10 - October Abstract - Optimal Tower Fields
Optimal Tower Fields
October 2004 (vol. 53 no. 10)
pp. 1231-1243
 ASCII Text x Sel?uk Baktir, Berk Sunar, "Optimal Tower Fields," IEEE Transactions on Computers, vol. 53, no. 10, pp. 1231-1243, October, 2004.
 BibTex x @article{ 10.1109/TC.2004.83,author = {Sel?uk Baktir and Berk Sunar},title = {Optimal Tower Fields},journal ={IEEE Transactions on Computers},volume = {53},number = {10},issn = {0018-9340},year = {2004},pages = {1231-1243},doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2004.83},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - JOURJO - IEEE Transactions on ComputersTI - Optimal Tower FieldsIS - 10SN - 0018-9340SP1231EP1243EPD - 1231-1243A1 - Sel?uk Baktir, A1 - Berk Sunar, PY - 2004KW - Optimal tower fieldsKW - OEFKW - finite fieldsKW - multiplicationKW - inversionKW - elliptic curve cryptography.VL - 53JA - IEEE Transactions on ComputersER -
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.

[1] A. Woodbury, D.V. Bailey, and C. Paar, Elliptic Curve Cryptography on Smart Cards without Coprocessors Proc. IFIP CARDIS 2000, Fourth Smart Card Research and Advanced Application Conf., Sept. 2000.
[2] R. Schroeppel, H. Orman, S. O'Malley, and O. Spatscheck, Fast Key Exchange with Elliptic Curve Systems Proc. Advances in Cryptology CRYPTO '95, D. Coppersmith, ed., pp. 43-56, 1995.
[3] Ç.K. Koç and T. Acar, Montgomery Multplication in$GF(2^k)$ Design, Codes, and Cryptography, vol. 14, no. 1, pp. 57-69, 1998.
[4] I.S. Hsu,T.K. Truong,L.J. Deutsch, and I.S. Reed,"A Comparison of VLSI Architectures of Finite Field Multipliers Using Dual, Normal or Standard Bases," IEEE Trans. Computers, vol. 37, no. 6, pp. 735-737, June 1988.
[5] T. Itoh and S. Tsujii, A Fast Algorithm for Computing Multiplicative Inverses in$GF(2^m)$Using Normal Bases Information and Computation, vol. 78, pp. 171-177, 1988.
[6] B. Sunar, Fast Galois Field Arithmetic for Elliptic Curve Cryptography and Error Control Codes PhD thesis, Dept. of Electrical&Computer Eng., Oregon State Univ., Corvallis, Nov. 1998.
[7] W. Geiselmann and D. Gollmann, Self-Dual Bases in$F_{q^n}$ Designs, Codes, and Cryptography, vol. 3, pp. 333-345, 1993.
[8] S.T.J. Fenn, M. Benaissa, and D. Taylor, Finite Field Inversion over the Dual Basis IEEE Trans. Very Large Scale Integration (VLSI) Systems, vol. 4, no. 1, pp. 134-136, Mar. 1996.
[9] M.A. Hasan, Double-Basis Multiplicative Inversion over${\rm GF}(2^m)$ IEEE Trans.n Computers, vol. 47, no. 9, pp. 960-970, Sept. 1998.
[10] D.V. Bailey and C. Paar, Efficient Arithmetic in Finite Field Extensions with Application in Elliptic Curve Cryptography J. Cryptology, vol. 14, no. 3, pp. 153-176, 2001.
[11] D.V. Bailey and C. Paar, Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms Proc. Advances in Cryptology CRYPTO '98, H. Krawczyk, ed., pp. 472-485, 1998.
[12] R. Lidl and H. Niederreiter, Finite Fields, vol. 20 of Encyclopedia of Math. and Its Applications. Reading, Mass.: Addison-Wesley, 1983.
[13] J. Guajardo and C. Paar, Itoh-Tsujii Inversion in Standard Basis and Its Application in Cryptography Design, Codes, and Cryptography, no. 25, pp. 207-216, 2002.
[14] G.I. Davida, Inverse of Elements of a Galois Field Electronic Letters, vol. 8, pp. 518-520, Oct. 1972.
[15] M. Morii and M. Kasahara, Efficient Construction of Gate Circuit for Computing Multiplicative Inverses over$GF(2^m)$ Trans. IEICE, vol. E 72, pp. 37-42, Jan. 1989.
[16] A. Karatsuba and Y. Ofman, Multiplication of Multidigit Numbers on Automata Sov. Phys. Dokl. (English translation), vol. 7, no. 7, pp. 595-596, 1963.
[17] P. Gaudry, F. Hess, and N.P. Smart, Constructive and Destructive Facets of Weil Descent on Elliptic Curves J. Cryptology, vol. 15, pp. 19-46, 2002.
[18] N. P. Smart, How Secure Are Elliptic Curves over Composite Extension Fields? Technical Report CSTR-00-017, Dept. of Computer Science, Univ. of Bristol, Nov. 2000.
[19] N.P. Smart, A Comparison of Different Finite Fields for Use in Elliptic Curve Cryptosystems Technical Report CSTR-00-007, Dept. of Computer Science, Univ. of Bristol, June 2000.

Index Terms:
Optimal tower fields, OEF, finite fields, multiplication, inversion, elliptic curve cryptography.
Citation:
Sel?uk Baktir, Berk Sunar, "Optimal Tower Fields," IEEE Transactions on Computers, vol. 53, no. 10, pp. 1231-1243, Oct. 2004, doi:10.1109/TC.2004.83