Optimal tower fields

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/sup 2/), significantly better than that of the Itoh-Tsujii algorithm, i.e., O(m/sup 2/(log/sub 2/m.)). This complexity is further improved to O(m/sup log//sub 2//sup 3/) 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]  M. Anwar Hasan.  Double-Basis Multiplicative Inversion Over GF(2m) , 1998, IEEE Trans. Computers.

[2]  David Taylor,et al.  Finite field inversion over the dual basis , 1996, IEEE Trans. Very Large Scale Integr. Syst..

[3]  ItohToshiya,et al.  A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases , 1988 .

[4]  M. Kasahara,et al.  Efficient Construction of Gate Circuit for Computing Multiplicative Inverses over GF (2 m ) , 1989 .

[5]  Christof Paar,et al.  Elliptic Curve Cryptography on Smart Cards without Coprocessors , 2001, CARDIS.

[6]  ÇETIN K. KOÇ,et al.  Montgomery Multiplication in GF(2k) , 1998, Des. Codes Cryptogr..

[7]  Trieu-Kien Truong,et al.  A Comparison of VLSI Architecture of Finite Field Multipliers Using Dual, Normal, or Standard Bases , 1988, IEEE Trans. Computers.

[8]  Christof Paar,et al.  Itoh-Tsujii Inversion in Standard Basis and Its Application in Cryptography and Codes , 2002, Des. Codes Cryptogr..

[9]  George I. Davida.  Inverse of elements of a Galois field , 1972 .

[10]  Nigel P. Smart,et al.  Constructive and destructive facets of Weil descent on elliptic curves , 2002, Journal of Cryptology.

[11]  Christof Paar,et al.  Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms , 1998, CRYPTO.

[12]  Rudolf Lide,et al.  Finite fields , 1983 .

[13]  Ieee Circuits,et al.  IEEE Transactions on Very Large Scale Integration (VLSI) Systems , 2018, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[14]  B. Sunar.  Fast Galois field arithmetic for elliptic curve cryptography and error control codes , 1998 .

[15]  Hilarie K. Orman,et al.  Fast Key Exchange with Elliptic Curve Systems , 1995, CRYPTO.

[16]  Nigel P. Smart,et al.  A comparison of different finite fields for use in elliptic curve cryptosystems , 2000 .

[17]  Nigel P. Smart,et al.  How Secure Are Elliptic Curves over Composite Extension Fields? , 2001, EUROCRYPT.

[18]  T. Itoh,et al.  A Fast Algorithm for Computing Multiplicative Inverses in GF(2^m) Using Normal Bases , 1988, Inf. Comput..

[19]  Anatolij A. Karatsuba,et al.  Multiplication of Multidigit Numbers on Automata , 1963 .