ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Theoretical Computer Science
Volume 352, Issues 1-3, 7 March 2006, Pages 293-305
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (256 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.tcs.2005.11.045    How to Cite or Link Using DOI (Opens New Window)
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

S. BalletCorresponding Author Contact Information, E-mail The Corresponding Author

Laboratoire de Géométrie Algébrique et Applications à la Théorie de l’Information, Université de la Polynésie Française, BP 6570, 98702 Faa’a, Tahiti, Polynésie Française

Received 29 September 2005; 
accepted 19 November 2005. 
Communicated by V. Pan. 
Available online 13 January 2006.

Purchase the full-text article



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


 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.