Related Concepts
Definition
A primitive element of a finite field is a generator of the multiplicative group of the field.
Theory
Let α be an element of the finite field \({\text{ F} }_{{q}^{d}}\). If α is a generator of \({\text{ F} }_{{q}^{d}}^{{_\ast}}\), i.e., if the set of elements \(\alpha, {\alpha }^{2},{\alpha }^{3},\,\ldots \) traverses all elements in \({\text{ F} }_{{q}^{d}}^{{_\ast}}\), then α is a primitive element.
Let f(x) be the irreducible polynomial of degree d used to construct the extension field \(\text{ F }_{{q}^{d}}\) over the subfield F q , and let α be a root of f(x). If α is a primitive element then f(x) is called a primitive polynomial.
Every finite field \({\text{ F} }_{{q}^{d}}\) has \(\phi ({q}^{d} - 1)\) primitive elements and \(\phi ({q}^{d} - 1)/d\) primitive polynomials, where ϕ is Euler’s totient function.
In the degenerate case where d = 1, any element α that generates the multiplicative group \({\text{...
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this entry
Cite this entry
Kaliski, B. (2011). Primitive Element. In: van Tilborg, H.C.A., Jajodia, S. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-5906-5_426
Download citation
DOI: https://doi.org/10.1007/978-1-4419-5906-5_426
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5905-8
Online ISBN: 978-1-4419-5906-5
eBook Packages: Computer ScienceReference Module Computer Science and Engineering