Related papers: Optimal Normal Bases Over Finite Fields
This paper surveys and illustrates geometric methods for constructing normal bases allowing efficient finite field arithmetic. These bases are constructed using the additive group, the multiplicative group and the Lucas torus. We describe…
Recent work of Pickett has given a construction of self-dual normal bases for extensions of finite fields, whenever they exist. In this article we present these results in an explicit and constructive manner and apply them, through computer…
A new criterion on normal bases of finite field extension $\mathbb{F}_{q^n} / \mathbb{F}_{q}$ is presented and explicit criterions for several particular finite field extensions are derived from this new criterion.
We give a completely normal element in the maximal real subfield of a cyclotomic field over the field of rational numbers, which is different from that of Okada. This result is a consequence of the criterion for a normal element developed…
We construct two new families of basis for finite field extensions. Basis in the first family, the so-called elliptic basis, are not quite normal basis, but they allow very fast Frobenius exponentiation while preserving sparse…
We give a simple derivation of the formula for the number of normal elements in an extension of finite fields. Our proof is based on the fact that units in the Galois group ring of a field extension act simply transitively on normal…
In this article, we define the notion of slim (normal) bases and show their existence for various fields. As an application, an algorithm will be given that computes the spectrum of a basefield transform by merely using O(n) additions.
Normal bases in finite fields constitute a vast topic of large theoretical and practical interest. Recently, $k$-normal elements were introduced as a natural extension of normal elements. The existence and the number of $k$-normal elements…
Let $F/E$ be a finite Galois extension of fields with abelian Galois group $\Gamma$. A self-dual normal basis for $F/E$ is a normal basis with the additional property that $Tr_{F/E}(g(x),h(x))=\delta_{g,h}$ for $g,h\in\Gamma$.…
Let K be a finite Galois extension of Q. The normal basis theorem provides an element of K whose conjugates form a Q-basis of K. Here we obtain such an element with controlled size. This improves a recent result by Fukshansky and Jeong. By…
Normal bases and self-dual normal bases over finite fields have been found to be very useful in many fast arithmetic computations. It is well-known that there exists a self-dual normal basis of $\mathbb{F}_{2^n}$ over $\mathbb{F}_2$ if and…
In the field of algebraic systems biology, the number of minimal polynomial models constructed using discretized data from an underlying system is related to the number of distinct reduced Gr\"obner bases for the ideal of the data points.…
We describe a standard form for the elements in the universal field of fractions of free associative algebras (over a commutative field). It is a special version of the normal form provided by Cohn and Reutenauer and enables the use of…
A new efficient algorithm is proposed for factoring polynomials over an algebraic extension field. The extension field is defined by a polynomial ring modulo a maximal ideal. If the maximal ideal is given by its Groebner basis, no extra…
Most algorithms constructing bases of finite-dimensional vector spaces return basis vectors which, apart from orthogonality, do not show any special properties. While every basis is sufficient to define the vector space, not all bases are…
The notion of normal elements for finite fields extension has been generalized as k-normal elements by Huczynska et al. [3]. The number of k-normal elements for a fixed finite field extension has been calculated and estimated [3], and…
Let $U/L$ be a finite abelian extension of number fields. We first construct a universal primitive generator of $U$ over $L$ whose relative trace to any intermediate field $F$ becomes a generator of $F$ over $L$, too. We also develop a…
This paper builds fundamental perfect fields of positive characteristic and shows the structure of perfect fields that a field of positive characteristic is a perfect field if and only if it is an algebraic extension of a fundamental…
In this paper we present an algorithm for computing all algebraic intermediate subfields in a separably generated unirational field extension (which in particular includes the zero characteristic case). One of the main tools is Groebner…
Binary field extensions are fundamental to many applications, such as multivariate public key cryptography, code-based cryptography, and error-correcting codes. Their implementation requires a foundation in number theory and algebraic…