Abstract
Another important area of the theory of finite fields is designing fast algorithms to find irreducible and primitive polynomials over finite fields. These polynomials have many applications in coding theory, cryptography, complexity theory, computer science and computational mathematics; see the books [208, 1510, 1743, 1741, 1808] and the recent papers [26, 366, 535, 780, 972, 1129, 1131, 2185, 2631].
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). Finding Irreducible and Primitive Polynomials. In: Finite Fields: Theory and Computation. Mathematics and Its Applications, vol 477. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-9239-0_4
Download citation
DOI: https://doi.org/10.1007/978-94-015-9239-0_4
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5203-2
Online ISBN: 978-94-015-9239-0
eBook Packages: Springer Book Archive