Elliptic periods for finite fields

Finite Fields and their Applications

Volumn 15, Issue 1, 2009, Pages 1-22

  Couveignes, Jean Marc ^a   Lercier, Reynald ^b,c  

^a UNIVERSITÉ DE TOULOUSE   (France)

^b Delegation Generale pour l'Armement   (France)

^c UNIVERSITÉ DE RENNES 1   (France)

Author keywords

Complexity; Elliptic curves; Normal basis

Indexed keywords

FINITE ELEMENT METHOD;

COMPLEXITY; ELLIPTIC CURVE; EXPONENTIATIONS; FINITE FIELD EXTENSIONS; FINITE FIELDS; NORMAL BASIS; QUASI-LINEAR;

ALGEBRA;

EID: 56749164928     PISSN: 10715797     EISSN: 10902465     Source Type: Journal    
DOI: 10.1016/j.ffa.2008.07.004     Document Type: Article

References (22)

1. L.M. Adleman, H.W. Lenstra, Finding irreducible polynomials over finite fields, in: Proceedings of the 18th Annual ACM Symposium on the Theory of Computing, 1986, pp. 350-355
2. Ash D.W., Blake I.F., and Vanstone S.A. Low complexity normal basis. Discrete Appl. Math. 25 3 (1989) 191-210
3. Ballet S. An improvement of the construction of the D.V. and G.V. Chudnovsky algorithm for multiplication in finite fields. Theoret. Comput. Sci. 352 (2006) 293-305
4. Canon J., Bosma W., Fieker C., and Steel A. Handbook of Magma Functions (2008), Sydney version 2.14
5. Cantor D.G., and Kaltofen E. On fast multiplication of polynomials over arbitrary algebras. Acta Inform. 28 (1991) 693-701
6. Chaumine J. Complexité bilinéaire de la multiplication dans des petits corps finis. C. R. Acad. Sci. Paris Ser. I 343 (2006)
7. M. Christopoulou, T. Garefalakis, D. Panario, D. Thomson, The trace of an optimal normal element and low complexity normal bases, Des. Codes Cryptogr. (2008), in press
8. Chudnovsky D.V., and Chudnovsky G.V. Algebraic complexities and algebraic curves over finite fields. J. Complexity 4 (1988) 285-316
9. Couveignes J.-M., and Lercier R. Galois Invariant Smoothness Basis. Ser. Number Theory Appl. vol. 5 (2008) 154-179
10. S. Gao, Normal basis over finite fields, PhD thesis, Waterloo University, 1993
11. Gao S., and Lenstra H.W. Optimal normal basis. Des. Codes Cryptogr. 2 (1992) 315-323
12. Gao S., von zur Gathen J., Panario D., and Shoup V. Algorithms for exponentiation in finite fields. J. Symbolic Comput. 29 6 (2000) 879-889
13. von zur Gathen J., and Nöcker M. Computing special powers in finite fields. Math. Comp. 73 247 (2004) 1499-1523
14. m) using normal basis. Inform. and Comput. 78 (1988) 171-177
15. Iwaniec H. On the problem of Jacobsthal. Demonstratio Math. 11 (1978) 225-231
16. n). Discrete Appl. Math. 22 (1989) 149-161
17. Schönhage A. Schnelle Multiplikation von Polynomen über Körpen der Characteristik 2. Acta Inform. 7 (1977) 395-398
18. Schönhage A., and Strassen V. Schnelle Multiplikation grosser Zahlen. Computing 7 (1971) 281-292
19. Shokrollahi M.A. Optimal algorithms for multiplication in certain finite fields using algebraic curves. SIAM J. Comput. 21 6 (1992) 1193-1198
20. Silverman J. The Arithmetic of Elliptic Curves (1986), Springer
21. Wan Z.-X., and Zhou K. On the complexity of the dual basis of a type I optimal normal basis. Finite Fields Appl. 13 (2007) 411-417
22. Wassermann A. Zur Arithmetik in endlichen Körpern. Bayreuth. Math. Schr. 44 (1993) 147-251