Copyright © 2006 Elsevier B.V. All rights reserved.
An improvement of the construction of the D.V. and G.V. Chudnovsky algorithm for multiplication in finite fields
Received 29 September 2005;
accepted 19 November 2005.
Communicated by V. Pan.
Available online 13 January 2006.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
From an interpolation method on algebraic curves, due to D.V. Chudnovsky and G.V. Chudnovsky, we give a new method for the construction of bilinear algorithms for multiplication in the extensions of finite fields. We obtain algorithms better than known ones.
Keywords: Algorithm; Bilinear complexity; Finite fields; Algebraic function fields; Algebraic curves







E-mail Article
Add to my Quick Links

Cited By in Scopus (1)

1 defined over a finite field 




