Elliptic periods for finite fields

We construct two new families of basis for finite field extensions. Bases in the first family, the so-called elliptic bases, are not quite normal bases, but they allow very fast Frobenius exponentiation while preserving sparse multiplication formulas. Bases in the second family, the so-called normal elliptic bases are normal bases and allow fast (quasi-linear) arithmetic. We prove that all extensions admit models of this kind.

[1]  D. V. Chudnovsky,et al.  Algebraic complexities and algebraic curves over finite fields , 1987, J. Complex..

[2]  Arnold Schönhage,et al.  Schnelle Multiplikation großer Zahlen , 1971, Computing.

[3]  Jean Chaumine.  Complexité bilinéaire de la multiplication dans des petits corps finis , 2006 .

[4]  Zhe-Xian Wan,et al.  On the complexity of the dual basis of a type I optimal normal basis , 2007, Finite Fields Their Appl..

[5]  A. Wassermann,et al.  Zur Arithmetik in endlichen Körpern , 1993 .

[6]  Joachim von zur Gathen,et al.  Computing special powers in finite fields , 2003, Math. Comput..

[7]  Joachim von zur Gathen,et al.  Exponentiation in Finite Fields: Theory and Practice , 1997, AAECC.

[8]  W. Bosma,et al.  HANDBOOK OF MAGMA FUNCTIONS , 2011 .

[9]  Arnold Schönhage,et al.  Schnelle Multiplikation von Polynomen über Körpern der Charakteristik 2 , 1977, Acta Informatica.

[10]  Henryk Iwaniec,et al.  ON THE PROBLEM OF JACOBSTHAL , 1978 .

[11]  Leonard M. Adleman,et al.  Finding irreducible polynomials over finite fields , 1986, STOC '86.

[12]  Reynald Lercier,et al.  Galois invariant smoothness basis , 2007 .

[13]  Daniel Panario,et al.  The trace of an optimal normal element and low complexity normal bases , 2008, Des. Codes Cryptogr..

[14]  Amin Shokrollahi.  Optimal Algorithms for Multiplication in Certain Finite Fields Using Elliptic Curves , 1992, SIAM J. Comput..

[15]  Ronald C. Mullin,et al.  Optimal normal bases in GF(pn) , 1989, Discret. Appl. Math..

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

[17]  Erich Kaltofen,et al.  On fast multiplication of polynomials over arbitrary algebras , 1991, Acta Informatica.

[18]  Ian F. Blake,et al.  Low complexity normal bases , 1989, Discret. Appl. Math..

[19]  Shuhong Gao,et al.  Optimal normal bases , 1992, Des. Codes Cryptogr..

[20]  Joseph H. Silverman,et al.  The arithmetic of elliptic curves , 1986, Graduate texts in mathematics.

[21]  Joachim von zur Gathen,et al.  Algorithms for Exponentiation in Finite Fields , 2000, J. Symb. Comput..

[22]  Stéphane Ballet,et al.  An improvement of the construction of the D.V. and G.V. Chudnovsky algorithm for multiplication in finite fields , 2006, Theor. Comput. Sci..