Finding normal bases over finite fields with prescribed trace self-orthogonal relations

Abstract

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 F2n over F2 if and only if 4 n. In this paper, we prove there exists a normal element α of F2n over F2 corresponding to a prescribed vector a=(a0,a1,...,an-1)∈ F2n such that ai=Tr2n|2(α1+2i) for 0≤ i≤ n-1, where n is a 2-power or odd, if and only if the given vector a is symmetric (ai=an-i for all i, 1≤ i≤ n-1), and one of the following is true. 1) n=2s≥ 4, a0=1, an/2=0, Σ1≤ i≤ n/2-1, (i,2)=1ai=1; 2) n is odd, (Σ0≤ i≤ n-1aixi,xn-1)=1. Furthermore we give an algorithm to obtain normal elements corresponding to prescribed vectors in the above two cases. For a general positive integer n with 4|n, some necessary conditions for a vector to be the corresponding vector of a normal element of F2n over F2 are given. And for all n with 4|n, we prove that there exists a normal element of F2n over F2 such that the Hamming weight of its corresponding vector is 3, which is the lowest possible Hamming weight.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…