On multiplication in finite fields

Journal of Complexity

Volumn 26, Issue 2, 2010, Pages 172-186

  Cenk, Murat ^a   Özbudak, Ferruh ^b  

^a CANKAYA UNIVERSITY   (Turkey)

^b MIDDLE EAST TECHNICAL UNIVERSITY   (Turkey)

Author keywords

Algebraic function fields; Bilinear complexity; Finite fields

Indexed keywords

COMPUTATIONAL COMPLEXITY; NUMERICAL ANALYSIS;

ALGEBRAIC FUNCTION FIELD; BILINEAR COMPLEXITY; FINITE FIELDS; MULTIPLICATION ALGORITHMS;

FINITE ELEMENT METHOD;

EID: 77649339854     PISSN: 0885064X     EISSN: 10902708     Source Type: Journal    
DOI: 10.1016/j.jco.2009.11.002     Document Type: Article

References (29)

1. N. Arnaud, Evaluation Dérivée, Multiplication dans les Corps finis et codes correcteurs, Ph.D. dissertation, Université de la Méditerranée, France, 2006
2. q. Finite Fields their Applications 5 (1999) 364-377
3. Ballet S. Quasi-optimal algorithms for multiplication in the extension of degree 13, 14, and 15. Journal of Pure and Applied Algebra 171 (2002) 149-164
4. Ballet S., and Rolland R. Multiplication algorithm in a finite field and tensor rank of the multiplication. Journal of Algebra 272/1 (2004) 173-185
5. Ballet S., and Chaumine J. On the bounds of the bilinear complexity of multiplication in some finite fields. Applicable Algebra in Engineering, Communication and Computing 15 (2004) 205-211
6. Ballet S., Le Brigand D., and Rolland R. On an application of the definition field descent of a tower of function filed. Colloque International Arithmetic, Geometry and Coding Theory 2005 (AGCT 10). Société Mathématiques de France, sér. Séminaires et Congrés vol. 21 (2009) 187-203
7. Ballet S. An improvement of the construction of the D.V. and G.V. Chudnovsky algorithm for multiplication in finite fields. Theoretical Computer Science 352 (2006) 293-305
8. Ballet S. On the tensor rank of the multiplication in the finite fields. Journal of Number Theory 128 (2008) 1795-1806
9. Ballet S. A note on the tensor rank of the multiplication in certain finite fields. In: Hirschfeld J., Chaumine J., and Rolland R. (Eds). Algebraic Geometry and its Applications. (Proceedings of Symposium of Algebraic Geometry and Applications, Tahiti, 7-11 mai 2007). Number Theory and its Applications vol. 5 (2008), World Scientific 332-342
10. 2, preprint IML 2008, web site IML
11. Bosma W., Cannon J., and CPlayoust C. The Magma algebra system I. The user language. Journal of Symbolic Computation 24 3-4 (1997) 235-265
12. 2 using Chinese Remainder Theorem. IEEE Transactions on Computers 58 4 (2009) 572-576
13. ℓ m , m ≥ 1 and 5 ≤ ℓ ≤ 18. Africacrypt 2008. Lecture Notes in Computer Science vol. 5023 (2008), Springer-Verlag 406-414
14. Chudnovsky D.V., and Chudnovsky G.V. Algebraic complexities and algebraic curves over finite fields. Journal of Complexity 4 (1988) 285-316
15. Fan H., and Hasan M.A. Comments on five, six, and seven-term Karatsuba-like formulae. IEEE Transactions on Computers 56 5 (2007) 716-717
16. Montgomery P.L. Five, six, and seven-term Karatsuba-like formulae. IEEE Transactions on Computers 54 3 (2005) 362-369
17. National Institute of Standards and Technology. Digital Signature Standard (2000), FIPS Publication 186-2
18. Niederreiter H., and Xing C. Rational Points on Curves Over Finite Fields: Theory and Applications (2001), Cambridge University Press, Cambridge, UK
19. Niederreiter H., and Özbudak F. Constructions of digital nets using global function fields. Acta Arithmetica 105 3 (2002) 279-302
20. Niederreiter H., and Özbudak F. Improved asymptotoic bounds for codes using distinguished divisors of global function fields. SIAM Journal on Discrete Mathematics 21 4 (2007) 865-899
21. Page D., and Smart N.P. Hardware implementation of finite fields of characteristic three. CHESS 2003. Lecture Notes in Computer Science vol. 2523 (2003), Springer-Verlag pp. 539-539
22. Shokrollahi M.A. Optimal algortihms for multiplication in certain finite fields using algebraic curves. SIAM Journal on Computing 21 6 (1992) 1193-1198
23. Shparlinski I.E., Tsfasman M.A., and Vladut S.G. Curves with many points and multiplication in finite fields. Lecture Notes in Mathematics vol. 1518 (1992), Springer, Berlin 145-169
24. Stichtenoth H. Algebraic Function Fields and Codes (1993), Springer, Berlin
25. k) multipliers. IEEE Transactions on Computers 53 9 (2004) 1097-1105
26. A. Weimerskirch, C. Paar, Generalizations of the Karatsuba algorithm for polynomial multiplication. Avaliable at: http://eprint.iacr.org/2006/224
27. Winograd S. Arithmetic Complexity of Computations (1980), SIAM
28. Xing C.P., and Niederreiter H. Low-discrepancy sequences obtained from algebraic function-fields over finite-fields. Acta Arithmetica 72 3 (1995) 281-298
29. Xing C.P., Niederreiter H., and Lam K.Y. Constructions of algebraic-geometry codes. IEEE Transactions on Information Theory 45 4 (1999) 1186-1193