Engineering / Mathematics — Finite Fields
Conjugates, Norms and Traces
Conjugates of a finite field element, the norm and trace maps, and their surjectivity onto the subfield.
Executive summary
The conjugates of an element are its images under repeated Frobenius. Their product is the norm and their sum is the trace, both landing in the base subfield.
Both maps are surjective, which makes them useful for constructing elements with prescribed properties.
Learning objectives
- Define conjugates and relate them to the minimal polynomial.
- Define norm and trace and state their properties.
- Apply the trace to element construction.
01Conjugates
Conjugates
For α ∈ F_{q^k} over F_q, the conjugates are
α, α^q, α^{q²}, ..., α^{q^{d−1}}
where d is the degree of the minimal polynomial of α over F_q.
Minimal polynomial from conjugates
The minimal polynomial of α over F_q is
∏_{i=0}^{d−1} (X − α^{q^i}),
and d is the least positive integer with α^{q^d} = α.
The product has coefficients fixed by Frobenius, hence lying in F_q. This gives an explicit construction of the minimal polynomial from the element, and it is how minimal polynomials over finite fields are computed.
02Norm and trace
Norm and trace
N(α) = ∏ α^{q^i} and Tr(α) = Σ α^{q^i}, products and sums over all conjugates in the full extension.
| Property | Norm | Trace |
|---|---|---|
| Lands in | F_q | F_q |
| Multiplicative or additive | N(αβ) = N(α)N(β) | Tr(α+β) = Tr(α)+Tr(β) |
| On the base field | N(a) = a^k | Tr(a) = ka |
| Surjective onto F_q | Yes, on non-zero elements | Yes |
| Relation to minimal polynomial | ± constant term | − coefficient of X^{d−1} |
Both maps land in F_q because they are fixed by Frobenius: applying Frobenius permutes the conjugates cyclically, leaving the sum and product unchanged.
The trace is F_q-linear, so it is a linear functional on the extension viewed as a vector space. Surjectivity means its kernel is a hyperplane of dimension k − 1.
03Applications
Solving quadratics in characteristic 2
The equation x² + x = a is solvable exactly when Tr(a) = 0, and the trace condition is the whole solvability criterion.
Constructing normal bases
A normal basis consists of an element and its conjugates, making Frobenius a cyclic shift of coordinates — free in hardware.
Computing minimal polynomials
The product over conjugates gives the minimal polynomial directly, requiring only repeated Frobenius application.
The characteristic 2 application is used constantly in binary elliptic curve arithmetic, where point halving and coordinate recovery both require solving such equations. The trace test decides solvability in one linear computation.
04Frequently asked questions
Why are the conjugates distinct?
Because d is defined as the least exponent with α^{q^d} = α. An earlier coincidence would contradict minimality, so the orbit has exactly d distinct elements.
Is the trace ever identically zero?
Never as a map — it is always surjective onto the base field, so some element has non-zero trace. It vanishes on a hyperplane, which is exactly half the field when q = 2.
How is the norm related to the multiplicative group?
It is a surjective group homomorphism from the non-zero elements of the extension onto those of the base field, with kernel of size (q^k − 1)/(q − 1). That kernel is the norm-one subgroup, used in some cryptographic constructions.
Sources and method
Structural reference: Victor Shoup, A Computational Introduction to Number Theory and Algebra, Version 1, Cambridge University Press, 2005 — book pages 456-461.
This page carries the durable method layer only: definitions, constructions, algorithms, complexity results and selection criteria, authored originally for KEVOS. No text is transcribed or paraphrased from the source, and no numeric tables or benchmark data are reproduced — these are routed to live authoritative sources instead.
Author: Kevin Jogin. Last reviewed 2026-08-07.