Abstract
Now we are going to consider problems related to the complexity of computation in finite fields such as finding power, normal, primitive normal, and other bases for finite fields, computing some special functions in finite fields, polynomial multiplication and interpolation, bilinear complexity, complexity of arithmetic and matrix operations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media Dordrecht
About this paper
Cite this paper
Shparlinski, I.E. (1999). Bases and Computation in Finite Fields. In: Finite Fields: Theory and Computation. Mathematics and Its Applications, vol 477. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-9239-0_6
Download citation
DOI: https://doi.org/10.1007/978-94-015-9239-0_6
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5203-2
Online ISBN: 978-94-015-9239-0
eBook Packages: Springer Book Archive