Next Article in Journal
Mechanical Behavior of Double-Arch Tunnels under the Effect of Voids on the Top of the Middle Wall
Previous Article in Journal
Coupled Systems of Sequential Caputo and Hadamard Fractional Differential Equations with Coupled Separated Boundary Conditions
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Normal Bases on Galois Ring Extensions

1
Department of Mathematical Sciences, Xi’an University of Technology, Xi’an 710048, China
2
Department of Mathematical Sciences, Tsinghua University, Beijing 100084, China
*
Author to whom correspondence should be addressed.
Symmetry 2018, 10(12), 702; https://doi.org/10.3390/sym10120702
Submission received: 27 September 2018 / Revised: 8 November 2018 / Accepted: 27 November 2018 / Published: 3 December 2018

Abstract

:
Normal bases are widely used in applications of Galois fields and Galois rings in areas such as coding, encryption symmetric algorithms (block cipher), signal processing, and so on. In this paper, we study the normal bases for Galois ring extension R / Z p r , where R = GR ( p r , n ) . We present a criterion on the normal basis for R / Z p r and reduce this problem to one of finite field extension R ¯ / Z ¯ p r = F q / F p ( q = p n ) by Theorem 1. We determine all optimal normal bases for Galois ring extension.

1. Introduction

The theory of finite fields has been one of the fundamental mathematical tools in computer science and communication engineering since the 1950s, when digit communications and computations were rapidly developed. Low complexity operation, particularly the multiplicative operation, squaring, and exponentiation operations, are preferred in various applications, including coding, cryptography, and communication. The performance of these operations is closely related to the representation of the finite elements; they are desired for efficient hardware implementation, and in this respect, many useful bases for F q n / F q with low complexity have been found [1,2,3,4,5,6,7,8,9,10,11]. An efficient algorithm for field multiplication using a normal basis was proposed by Massey and Omura in 1985 [12].
In the past two decades, Galois rings have been used successfully in many aspects, such as in combinatorics to construct different kinds of combinatorial designs and in communication theory to construct error-correcting codes, sequences with good correlation properties, secret sharing schemes, hash functions, and so on [3,13,14,15,16]. However, compared to the case of finite field extensions, the complexity problem of operations in Galois rings has not attracted much attention from scholars, except Abrahamsson, who considered the complexity of bases and carefully discussed the architectures for multiplication in Galois rings (for p = 2 ) in his thesis [17] in 2004. These are motivation by our study of operations, particularly for multiplicative operation, with low complexity in Galois rings.
In this paper, we study one aspect of the complexity problem of operations in Galois rings. More precisely, we mainly focus on the normal bases for Galois ring extensions. This paper is organized as follows. In Section 2, we introduce some basic facts on Galois rings. Some results on normal bases and some basic properties on the multiplicative complexity of normal bases for Galois ring extension GR ( p r , n ) / Z p r are presented in Section 3. Then, we determine all optimal normal bases for these Galois ring extensions in Section 4.

2. Basic Facts about Galois Rings

In this section, we introduce several basic facts about Galois rings. For more information, the reader is referred to [18].
Let p be a prime number and r 2 , Z p r = Z / p r Z . We have the modulo p reduction mapping:
φ : Z p r F p , a ( mod p r ) a ¯ = a ( mod p ) ,
which induces the following modulo p reduction mapping between polynomial rings:
φ : Z p r [ x ] F p [ x ] , f ( x ) = c i x i f ¯ ( x ) = c ¯ i x i .
f ( x ) is said to be a monic basic irreducible (primitive) polynomial over Z p r if f ¯ ( x ) is a monic irreducible (primitive) polynomial over F p .
Let f ( x ) be a basic primitive polynomial of degree n in Z p r [ x ] . The quotient ring:
R = GR ( p r , n ) = Z p r [ x ] ( f ( x ) ) Z p r [ γ ] = { c 0 + c 1 γ + + c n 1 γ n 1 : c i Z p r } ,
where γ is a root of f ( x ) in R with order p n 1 , R is called a Galois ring. We note that γ ¯ is a primitive element of the finite field F q where q = p n . From now on, we take f ( x ) to be a basic primitive polynomial. The modulo p reduction can be naturally extended to the following homomorphism of rings:
φ : R = GR ( p r , n ) = Z p r [ x ] ( f ( x ) ) Z p r [ γ ] F q = F p [ x ] ( f ¯ ( x ) ) F p [ γ ¯ ] .
Some basic facts about Galois ring R = GR ( p r , n ) are given as follows.
(Fact 1) Let T * = γ be the cyclic multiplicative group of order q 1 generated by γ , and T = T * { 0 } . Then, T ¯ = F q and:
R = { x 0 + p x 1 + p 2 x 2 + + p r 1 x r 1 : x i T } , | R | = | T | r = q r = p n r .
(Fact 2) R is a local commutative ring with the unique maximal ideal M = p R , | M | = q r 1 , and the group of units is R * = R \ M = T * × ( 1 + M ) , | R * | = q r q r 1 .
(Fact 3) R / Z p r is a Galois extension of rings with Galois group G a l ( R / Z p r ) = σ p , where σ p is the automorphism of order n defined by:
σ p ( i = 0 r 1 p i x i ) = i = 0 r 1 p i x i p ( x i T ) .
More generally, for each positive integer l , R = GR ( p r , n ) is a subring of R ( l ) = GR ( p r , n l ) and R ( l ) / R is a Galois extension of rings with Galois group G a l ( R ( l ) / R ) = σ q , where σ q is the automorphism of R ( l ) defined by:
σ q ( i = 0 r 1 p i x i ) = i = 0 r 1 p i x i q ( x i T ( l ) ) ,
and R ( l ) = Z p r [ γ ( l ) ] = { i = 0 r 1 p i x i : x i T ( l ) } , T ( l ) = T ( l ) * { 0 } , T ( l ) * = γ ( l ) , γ ( l ) q l 1 q 1 = γ .
(Fact 4) We have the trace mapping:
Tr n n l : R ( l ) = GR ( p r , n l ) R = GR ( p r , n ) ,
defined by:
Tr n n l ( α ) = i = 0 l 1 σ q i ( α ) ( α R ( l ) ) ,
which is an epimorphism of R -modules, and we have the following commutative diagram:
Symmetry 10 00702 i001
where tr n n l and tr 1 n are the trace mappings for finite field extensions.
On the other hand, for r 2 , the modulo p r 1 reduction gives the homomorphism of rings GR ( p r , n ) GR ( p r 1 , n ) , and we get the following commutative diagram:
Symmetry 10 00702 i002
where σ ( λ ) is the automorphism of GR ( p λ , n ) defined by:
σ ( λ ) ( i = 0 λ 1 p i x i ) = i = 0 λ 1 p i x i p ( x i T ) .
Next, we need some basic properties of the polynomial ring R [ x ] . One of the most important properties of R [ x ] is the following Hensel’s lemma.
Two polynomials f ( x ) and g ( x ) in R [ x ] are called coprime if there exist A ( x ) and B ( x ) in R [ x ] such that f ( x ) A ( x ) + g ( x ) B ( x ) = 1 .
Lemma 1.
([18], Lemma 14.20) Let R = GR ( p r , n ) and R ¯ = F q ( q = p n ) . Let f ( x ) be a monic polynomial in R [ x ] and g i ( x ) ( 1 i s ) be pairwise coprime monic polynomials in R ¯ [ x ] . If f ¯ ( x ) = g 1 ( x ) g 2 ( x ) g s ( x ) in R ¯ [ x ] , then there exist pairwise coprime polynomials f i ( x ) ( 1 i s ) in R [ x ] such that f ( x ) = f 1 ( x ) f 2 ( x ) f s ( x ) and f ¯ i ( x ) = g i ( x ) ( 1 i s ) .
The polynomial f i ( x ) is called the Hensel lift of g i ( x ) . A monic polynomial f ( x ) in R [ x ] is called primary if f ¯ ( x ) is a power of a monic irreducible polynomial in F q [ x ] . One can deduce the following result from the Hensel’s lemma.
Lemma 2.
([18], Theorem 14.21) Let f ( x ) be a monic polynomial of deg f 1 in R [ x ] . We have the following decomposition:
f ( x ) = f 1 ( x ) f 2 ( x ) f r ( x ) ,
where f i ( x ) ( 1 i r ) are pairwise coprime primary polynomials in R [ x ] and f i ( x ) ( 1 i r ) are uniquely determined up to their order. Particularly, if f ¯ ( x ) = p 1 ( x ) p 2 ( x ) p r ( x ) where p i ( x ) ( 1 i r ) are distinct monic irreducible polynomials in R ¯ [ x ] = F q [ x ] , then f i ( x ) ( 1 i r ) are distinct monic irreducible polynomials in R [ x ] and f ¯ i ( x ) = p i ( x ) ( 1 i r ) .

3. Criteria on Normal Bases for Galois Ring Extensions

From (1), we know that R = GR ( p r , n ) is a free Z p r -module of rank n and { 1 , γ , , γ n 1 } is a basis for R / Z p r , where γ is an element of order q 1 ( q = p n ) in R .
Definition 1.
An element α R is called a normal basis generator (NBG) for extension R / Z p r if B = { σ 0 ( α ) = α , σ ( α ) , , σ n 1 ( α ) } is a basis for R / Z p r , where σ is the automorphism σ p of R defined by (3). Such a basis B is called a normal basis for R / Z p r .
In this section, we present several criteria on normal bases for Galois ring extension R / Z p r , and these criteria can be reduced to the ones of finite field extensions R ¯ / Z ¯ p r = F q / F p according to the following theorem. Recall that an element a F q ( q = p n ) is an NBG for F q / F p if B = { a , σ ¯ ( a ) , , σ ¯ n 1 ( a ) } is a normal basis for F q / F p , where σ ¯ is the Frobenius automorphism of F q defined by σ ¯ ( b ) = b p for b F q . From the definition of σ in (3), one has for α R , σ ( α ) ¯ = σ ¯ ( α ¯ ) .
Theorem 1.
For an element α in R , α is an NBG for R / Z p r if and only if α ¯ is an NBG for finite field extension R ¯ / Z ¯ p r = F q / F p .
Proof. 
Suppose that α ¯ is not an NBG for F q / F p . Then, there exist a i F p ( 0 i n 1 ) such that:
i = 0 n 1 a i σ ¯ i ( α ¯ ) = 0
and a j 0 for some j . Let A i R , A i ¯ = a i ( 0 i n 1 ) . The formula (7) implies that i = 0 n 1 A i σ i ( α ) ¯ = i = 0 n 1 a i σ ¯ i ( α ¯ ) = 0 , so that i = 0 n 1 A i σ i ( α ) p R . Therefore, i = 0 n 1 p r 1 A i σ i ( α ) = 0 . From a j F p × , we know that A j R * and p r 1 A j 0 . Therefore, α is not an NBG for R / Z p r .
On the other hand, suppose that α is not an NBG for R / Z p r . Then, there exist A i R ( 0 i n 1 ) such that:
i = 0 n 1 A i σ i ( α ) = 0
and A j 0 for some j . Let A i p d i R \ p d i + 1 R ( 0 i n 1 ) and d = m i n { d i | 0 i n 1 } . From A j 0 , we get 0 d r 1 . Then, A i = p d a i , where a i R ( 0 i n 1 ) and a j R * by assuming A j p d R \ p d + 1 R . The formula (8) implies that p d i = 0 n 1 a i σ i ( α ) = 0 , so that i = 0 n 1 a i σ i ( α ) p r d R . Then, from r d 1 , we get i = 0 n 1 a ¯ i σ ¯ i ( α ¯ ) = 0 , where a ¯ i F p ( 0 i n 1 ) and a ¯ j 0 . Therefore, α ¯ is not an NBG for F q / F p . This completes the proof of Theorem 1. □
By Theorem 1, a series of criteria on normal bases for finite field extensions can be shifted to ones for Galois ring extensions.
Lemma 3.
([19])Let n = p t l , ( l , p ) = 1 , Q = p n and q = p l . Let tr q Q be the trace mapping for F Q / F q . Then, for a F Q , a is an NBG for F Q / F p if and only if tr q Q ( a ) is an NBG for F q / F p .
From the diagram (5), we know that for α R , tr l n ( α ¯ ) = Tr l n ( α ) ¯ .
Corollary 1.
Let n = p t l , ( l , p ) = 1 . Let R = GR ( p r , n ) , R = GR ( p r , l ) , and Tr : R R be the trace mapping from R to R . Then, for α R , α is an NBG for R / Z p r if and only if Tr ( α ) is an NBG for R / Z p r .
By Corollary 1, we assume ( n , p ) = 1 without loss of generality. In this case, x n 1 has the following decomposition in the polynomial ring F p [ x ] :
x n 1 = p 1 ( x ) p 2 ( x ) p r ( x ) ,
where p 1 ( x ) , p 2 ( x ) , , p r ( x ) are distinct monic irreducible polynomials in F p [ x ] .
Let F p [ x ] be the set of all p-polynomials i c i x p i ( c i F p ) . Then, F p [ x ] is a ring with respect to the ordinary addition, and the following multiplication defined by composition ⊗:
F ( x ) G ( x ) = F ( G ( x ) ) , for F ( x ) , G ( x ) F p [ x ] ,
and the mapping:
μ : F p [ x ] F p [ x ] , i c i x i i c i x p i
is an isomorphism of rings. Corresponding to the decomposition (9) in F p [ x ] , we have the following decomposition of:
x p n x = P 1 ( x ) P 2 ( x ) P r ( x ) ,
where P i ( x ) = μ ( p i ( x ) ) ( 1 i r ) are distinct monic irreducible p-polynomials in F p [ x ] . Let m i ( x ) = x n 1 p i ( x ) and M i ( x ) = μ ( m i ( x ) ) = λ = 1 λ i r P λ ( x ) F p [ x ] .
Lemma 4.
([18]) Let q = p n and ( n , p ) = 1 . For a F q , a is an NBG for F q / F p if and only if M i ( a ) 0 ( 1 i r ) .
This is a direct consequence of Theorem 1 and Lemma 4. We have the following criterion.
Corollary 2.
Let R = GR ( p r , n ) , where ( n , p ) = 1 . Then, for α R , α is an NBG for R / Z p r if and only if M i ( α ¯ ) 0 ( 1 i r ) .
By the decomposition (9), we have:
F p [ x ] ( x n 1 ) = i = 1 r F p [ x ] ( p i ( x ) ) i = 1 r F p d i ,
where d i = deg p i ( x ) . Then, we have the orthogonal idempotents e i ( x ) F p [ x ] , deg e i ( x ) n 1 ( 1 i r ) satisfying:
e i ( x ) δ i j ( mod p j ( x ) ) ( 1 i j r ) ,
where δ i j is the Kronecker symbol. These idempotents e i ( x ) ( 1 i r ) can be computed by using the σ p -class of the roots of x n 1 (see [19]).
In [19], we present a new criterion of NBG for F q / F p ( q = p n , ( n , p ) = 1 ) by using idempotents in the ring F p [ x ] ( x n 1 ) .
Lemma 5.
([19]) Letting E i ( x ) = μ ( e i ( x ) ) F p [ x ] ( 1 i r ) , a F q ( q = p n , ( n , p ) = 1 ) , a is an NBG for F q / F p if and only if E i ( a ) 0 ( 1 i r ) .
Corollary 3.
Let R = G R ( p r , n ) , where ( n , p ) = 1 . Then, for α R , α is an NBG for R / Z p r if and only if E i ( α ¯ ) 0 F q ( 1 i r ) .
In [19], we present more explicit criteria on normal bases for F q / F p for several specific cases where the decomposition (9) has a simpler form. By Corollary 3, we can give more explicit criteria on normal bases of the Galois ring extension for such cases. For example, let p and n be prime numbers and ( Z / n Z ) * = p . Then, for a F q ( q = p n ) , a is an NBG for F q / F p if and only if a F p and tr ( a ) 0 , where tr : F q F p is the trace mapping. Let Tr : R = GR ( p r , n ) Z p r be the trace mapping. For α R ,
tr ( α ¯ ) F p tr ( α ¯ ) p tr ( α ¯ ) = 0 Tr ( α ) p Tr ( α ) p R
and:
tr ( α ¯ ) = 0 Tr ( α ) p R .
Corollary 4.
Let R = GR ( p r , n ) , where p and n are distinct prime numbers and ( Z / n Z ) * = p . Then, for α R , α is an NBG for R / Z p r if and only if both Tr ( α ) and Tr ( α ) p Tr ( α ) belong to R * .
We end this section by counting the number of NBG for R / Z p r where R = GR ( p r , n ) . It is well known ([18], Corollary 8.25) that the number of NBG’s for F q / F p ( q = p n ) is (let n = p e m and ( m , p ) = 1 ):
ψ q ( n ) = p n d m ( 1 p ord d ( p ) ) ϕ ( d ) / ord d ( p ) ,
where ϕ ( d ) is the Euler function and o r d d ( p ) is the order of p in ( Z / d Z ) * . Since the mapping φ : R = GR ( p r , n ) R ¯ = F q ( q = p n ) is surjective and F p -linear, we get that | K e r φ | = | R | / | R ¯ | = p r n n . As a direct consequence of Theorem 1, we can count the number of NBG’s for R / Z p r .
Corollary 5.
Let p be a prime number and n = p e m be a positive integer with ( m , p ) = 1 . For R = GR ( p r , n ) , the number of NBG’s for R / Z p r is:
ψ = p r n d m ( 1 p ord d ( p ) ) ϕ ( d ) / ord d ( p )
and the number of normal bases for R = GR ( p r , n ) is ψ / n .

4. Multiplicative Complexity on Normal Bases

It is known that normal bases on finite fields with low multiplication complexity have several applications in coding theory, cryptography, signal processing, and so on. As a comparison, Abrahamsson discussed the multiplicative complexity on normal bases over Galois rings and considered the architectures for multiplication in Galois rings (for p = 2 ) in his thesis. In this section, we discuss the complexity of normal bases for extension R / Z p r , where R = GR ( p r , n ) .
Definition 2.
Let α be an NBG for R / Z p r , so that B = { α , σ ( α ) , , σ n 1 ( α ) } is a normal basis for R / Z p r , where σ is the automorphism of R defined by (3). Then:
α σ i ( α ) = j = 0 n 1 c i j σ j ( α ) ( 0 i n 1 , c i j Z p r ) .
The multiplicative complexity M ( B ( α ) ) of the normal basis B is defined by the number of nonzero c i j . Namely,
M ( B ( α ) ) = { ( i , j ) : 0 i , j n 1 , c i j 0 } .
For each λ ( 1 λ r ) , α R , let α ( λ ) denote the modulo p λ reduction of α . The mapping:
R = GR ( p r , n ) R ( λ ) = GR ( p λ , n ) , α α ( λ )
is a homomorphism of rings and α ( r ) = α , α ( 1 ) = α ¯ GR ( p , n ) ¯ = R ( 1 ) ¯ = F p .
For α R ( = R ( r ) ) , α is an NBG for R / Z p r if and only if α ¯ is an NBG for F q / F p by Theorem 1, then this is also equivalent to α ( λ ) being an NBG for R ( λ ) / Z p r for any λ 1 . Moreover, by the diagram (6), we get that for any λ , the equality (10) implies that:
α ( λ ) σ ( λ ) i ( α ( λ ) ) = j = 0 n 1 c i j ( λ ) σ ( λ ) j ( α ( λ ) ) ( 0 i n 1 , c i j ( λ ) Z p λ ) .
If 0 c i j ( λ ) Z p λ , then 0 c i j ( μ ) Z p μ for all μ λ . Therefore, we get the following simple and basic result.
Theorem 2.
Let R = GR ( p r , n ) and α be an NBG for R / Z p r . Then, for each 1 λ r 1 , α ( λ ) is an NBG for R ( λ ) / Z p r , where R ( λ ) = GR ( p λ , n ) . Moreover, let B ( λ ) = B ( α ( λ ) ) = { σ ( λ ) i ( α ( λ ) ) : 0 i n 1 } . Then:
M ( B ( r ) ) M ( B ( r 1 ) ) M ( B ( 1 ) ) ,
where B ( 1 ) is the normal basis B ¯ = { α ¯ p i : 0 i n 1 } for GR ( p , n ) / Z p = F q / F p .
It is known that for any normal basis B for finite field extension F q n / F q , M ( B ) 2 n 1 . Hence, by Theorem 2, for any normal basis B for Galois ring extension GR ( p r , n ) / Z p r , M ( B ) 2 n 1 . The basis B is called optimal if M ( B ) = 2 n 1 . If B is an optimal normal basis for R / Z p r , then by Theorem 2,
2 n 1 = M ( B ) M ( B ( r 1 ) ) M ( B ( 1 ) ) 2 n 1 .
Therefore, M ( B ( λ ) ) = 2 n 1 . Namely, B ( λ ) is an optimal normal basis for R ( λ ) / Z p r for all 1 λ r . In particular, B ( 1 ) = B ¯ is an optimal normal basis for the finite field extension R ( 1 ) / Z p = F q / F p ( q = p n ) .
Definition 3.
Two elements α , β R * = GR ( p r , n ) * are equivalent to each other if α = ε β for some ε Z p r * , denoted by α β .
If α is an NBG for R / Z p r and α β , β = ε α for some ε Z p r * . It is easy to see that β is also an NBG for R / Z p r . Moreover, let:
α σ λ ( α ) = i = 0 n 1 c λ i σ i ( α ) ( c λ i Z p r , 0 λ n 1 ) .
Then, σ λ ( β ) = ε σ λ ( α ) and:
β σ λ ( β ) = i = 0 n 1 ε c λ i σ i ( β ) ( ε c λ i Z p r ) .
Since c λ i = 0 if and only if ε c λ i = 0 , two normal bases B ( α ) = { σ λ ( α ) : 0 λ n 1 } and B ( β ) = { σ λ ( β ) : 0 λ n 1 } have the same complexity: M ( B ( α ) ) = M ( B ( β ) ) .
All optimal normal bases for finite field extension have been determined in [8].
Lemma 6.
(Gao and Lenstra [8]) There are only two types of optimal normal bases B for finite field extension F p n / F p as follows.
Type (I): n + 1 and p are distinct prime numbers, Z n + 1 * = p , and B is equivalent to the following (optimal) normal bases for F p n / F p ,
B ( ξ ) = { σ p λ ( ξ ) = ξ p λ : 0 λ n 1 } = { ξ i : 1 i n } ,
where ξ is an (n+ 1)-th primitive root of one in the algebraic closure of F p , so that F p ( ξ ) = F p n .
Type (II): p = 2 and 2 n + 1 is a prime number, Z 2 n + 1 * = 1 , 2 , and B is equivalent to the following (optimal) normal bases for F 2 n / F 2 :
B ( ξ + ξ 1 ) = { σ 2 λ ( ξ + ξ 1 ) = ξ 2 λ + ξ 2 λ : 0 λ n 1 } = { ξ i + ξ i : 1 i n } ,
where ξ is a ( 2 n + 1 ) th root of one in the algebraic closure of F 2 , F 2 ( ξ + ξ 1 ) = F 2 n .
Abrahamsson [17] presented the following optimal normal bases for Galois ring extension as a generalization of Type (I) optimal normal bases for finite field extension.
Lemma 7.
([17]) Let p and n + 1 be distinct prime numbers such that Z n + 1 * = p . Let ζ be an ( n + 1 ) th root of one in R = GR ( p r , n ) . Then:
B ( ζ ) = { σ λ ( ζ ) = ζ p λ : 0 λ n 1 } = { ζ i : 1 λ n }
is an optimal normal basis for R / Z p r .
In this section, we determine all optimal normal bases for Galois ring extensions. If α R * and B ( α ) is an optimal normal basis for R / Z p r ( R = GR ( p r , n ) ) , then B ( α ¯ ) is an optimal normal basis for F q / F p ( q = p n ) , and then, B ( α ¯ ) is an optimal normal basis for Type (I) or Type (II) by Lemma 6. Now, we consider these two cases separately.
Theorem 3.
Suppose that n + 1 and p are distinct primes and Z n + 1 * = p , R = GR ( p r , n ) , n 2 . Then, any optimal normal basis for R / Z p r is equivalent to the one given by Lemma 6.
Proof. 
For r = 1 , R / Z p r = F q / F p is the finite field extension case. For r = 2 , we assume that B ( α ) = { σ λ ( α ) : 0 λ n 1 } is an optimal normal basis for R / Z p 2 , R = GR ( p 2 , n ) . Then, α ¯ = ξ , where ξ is an ( n + 1 ) th primitive root of one in F q ( q = p n ) . Let ζ be an ( n + 1 ) th primitive root of one in R such that ζ ¯ = ξ . Then, ζ T * by ( n + 1 ) | ( q 1 ) , where T * is the cyclic multiplicative group of R (see Fact 3 in Section 2), and:
α = ζ + p a = ζ + p i = 1 n c i ζ i ( a R , c i Z p 2 ) ,
since { ζ i : 1 i n } = { ζ p λ : 0 λ n 1 } is a (normal) basis for R / Z p 2 . Therefore:
σ λ ( α ) = ζ p λ + p i = 1 n c i ζ i p λ s i n c e σ λ ( ζ i ) = ζ i p λ , 0 λ n 1
and for 0 λ n 1 , λ n 2 (we can assume that n + 1 is an odd prime number, so that n is even),
α σ λ ( α ) = ( ζ + p i = 1 n c i ζ i ) ( ζ p λ + p i = 1 n c i ζ i p λ ) = ζ 1 + p λ + p i = 1 n c i ( ζ i + p λ + ζ 1 + i p λ ) since p 2 = 0 .
From λ n 2 , we know that p λ 1 ( mod n + 1 ) and 1 + p λ p μ ( mod n + 1 ) for some μ , 0 μ n 1 . Then, by (13), we have:
α σ λ ( α ) = ζ p μ + p i = 1 n c i ( ζ i + p λ + ζ 1 + i p λ ) = σ μ ( α ) + p i = 1 n c i ( ζ i + p λ + ζ 1 + i p λ ζ i ( 1 + p λ ) ) by ( 12 ) = σ μ ( α ) + p [ l = 0 n 1 ζ p l ( c p l p λ + c ( p l 1 ) p λ c p l ( 1 + p λ ) 1 ) + c p λ + c p λ ] ,
where we consider i Z n + 1 for c i and assume c 0 = 0 , so Equation (13) becomes:
α σ λ ( α ) = σ μ ( α ) + p ( l = 0 n 1 σ l ( α ) ( c p l p λ + c ( p l 1 ) p λ c p l ( 1 + p λ ) 1 ) ( c p λ + c p λ ) l = 0 n 1 σ l ( α ) ) ,
since σ l ( α ) σ l ( ζ ) ζ p l ( mod p ) and l = 0 n 1 σ l ( α ) l = 0 n 1 σ l ( ζ ) = l = 0 n 1 ζ p l = j = 1 n ζ j = 1 ( mod p ) .
Therefore for 0 λ n 1 , λ n 2 ,
α σ λ ( α ) = l = 0 n 1 b λ l σ l ( α ) ( b λ l Z p 2 ) ,
where:
b λ l = p ( c p l p λ + c ( p l 1 ) p λ c p l ( 1 + p λ ) 1 c p λ c p λ ) , if p l p μ ( 1 + p λ ) ( mod n + 1 ) ; 1 + p ( c 1 c p λ c p λ ) , if p l 1 + p λ ( mod n + 1 ) .
Then, the complexity M ( B ( α ) ) = λ = 0 n 1 M λ , where:
M λ = { l | 0 l n 1 , b λ l 0 Z p 2 } .
For the case of λ = n 2 ,
α σ n 2 ( α ) ζ p n / 2 ζ = ζ 1 ζ = 1 = i = 1 n ζ i = λ = 0 n 1 ζ p λ λ = 0 n 1 σ λ ( α ) ( mod p ) .
We get M n 2 = n . For 0 λ n 1 , λ n 2 , we have M λ 1 since b λ l 1 ( mod p ) for l satisfying p l 1 + p λ ( mod n + 1 ) . Then, we have:
2 n 1 = M ( B ( α ) ) = λ = 0 n 1 M λ = n + λ = 0 λ n 2 n 1 M λ n + λ = 0 λ n 2 n 1 1 = 2 n 1 ,
which implies that M λ = 1 for all 0 λ n 1 , λ n 2 , which means that b λ l = 0 for all 0 λ , l n 1 , λ n 2 and p l p λ + 1 ( mod n + 1 ) . Let s p λ , t p l ( mod n + 1 ) . From (14), one gets that B ( α ) is an optimal normal basis for GR ( p 2 , n ) / Z p 2 if and only if when 1 t n , 1 s n 1 and t 1 + s ( mod n + 1 ) , we have:
c s 1 c s + c t s + c ( t 1 ) s 1 c t ( 1 + s ) 1 = 0 Z p .
Particularly, for s = 1 , we get:
2 c 1 + 2 c t 1 c t / 2 = 0 , for 1 t n , t 2 .
If p = 2 , then c t / 2 = 0 F 2 for all 1 t n , t 2 . By assumption Z n + 1 * = 2 ; this means that c j = 0 for all 2 j n , so that α = ζ + p c 1 ζ = ( 1 + p c 1 ) ζ by (11), and the basis B ( α ) is equivalent to the one given by Lemma 6.
Now, we assume that p 3 . For any fixed s , 1 s n 1 , by (15), we get:
0 = t = 1 t 1 + s n ( c s 1 c s + c t s + c ( t 1 ) s 1 c t ( 1 + s ) 1 ) = ( n 1 ) ( c s 1 c s ) + l = 0 l 1 , s n c l + l = 0 l s 1 , 1 n c l l = 0 l 0 , 1 n c l = ( 1 n ) ( c s 1 + c s ) + l = 1 n c l c 1 c s c s 1 = n ( c s 1 + c s ) + A
where A = l = 2 n c l . Therefore:
n ( c s + c s 1 ) = A
for all s , 1 s n 1 . If 3 p n , and we get c s + c s 1 = A n for all 1 s n 1 . In particular, for s = 1 , we get c n = c 1 = A 2 n and:
A = c n + l = 2 n 1 c l = A 2 n + n 2 2 A n = n 1 2 n A .
Therefore, ( n + 1 ) A = 0 and A = 0 F p , since ( p , n + 1 ) = 1 . Then, we have c n = 0 and c s + c s 1 = 0 for 2 s n 1 . Taking t = s in (15) and remarking that c 0 = 0 , we get c s 1 s = c s s + 1 for 2 s n 1 .
Namely,
c 1 2 = c 2 3 = = c n 1 n .
Since, for 1 a , b n 1 ,
a a + 1 b b + 1 ( mod n + 1 ) a b ( mod n + 1 ) a = b ,
we know that { s 1 s ( m o d n + 1 ) : 2 s n } = Z n + 1 \ { 0 , 1 } . Therefore, c 2 = c 3 = = c n 1 = c n = 0 , and α = ( 1 + p c 1 ) ζ . Therefore, B ( α ) is equivalent to the one given by Lemma 6. If 3 p n , from (16), we have A = 0 . In this case, we fix t ( 2 t n 1 ) , and the condition (15) implies that:
0 = s = 1 s t 1 n 1 ( c s 1 c s + c t s + c ( t 1 ) s 1 c t ( 1 + s ) 1 ) = l = 2 l ( t 1 ) 1 n c l l = 2 l 1 t n c l + l = 2 l t , t + 1 n c l + l = 2 l 1 t n c l l = 2 l t n c l = c ( t 1 ) 1 + c 1 t c t c t + 1 c 1 t + c t = c ( t 1 ) 1 c t + 1 .
Let a = ( t 1 ) 1 ; we get:
c a = c 2 a 1 ( 2 a n ) .
Consider the fraction linear transformation:
f : Z n + 1 { } Z n + 1 { } , f ( x ) = 2 x 1 = 2 x 1 x
with matrix M = 2 1 1 0 . For any m 0 , M m = m + 1 m m ( m 1 ) , so that:
f m ( 2 ) = 2 ( m + 1 ) m 2 m ( m 1 ) = 1 + 1 m + 1 Z n + 1 \ { 0 , 1 } ( 0 m n 2 ) .
Therefore, { f m ( 2 ) : 0 m n 2 } = Z n + 1 \ { 0 , 1 } = { 2 , 3 , , n } . By (17), we get:
c 2 = c 3 = = c n = 1 n 1 A = 0 .
Thus, α = ( 1 + p c 1 ) ζ ζ . This completes the proof of Theorem 3 for r = 2 .
Now, we assume that r 3 , and this theorem is true for r 1 . Let α R = GR ( p r , n ) , and { σ λ ( α ) : 0 λ n 1 } is an optimal normal basis for R / Z p r . By assumption, we have, up to equivalence,
α = ζ + p r 1 a ( a R ) = ζ + p r 1 i = 1 n c i ζ i ( c i Z p r ) .
Then, the same argument for r = 2 can be shifted to get c i = 0 for all 2 i n . Therefore, α = ( 1 + p r 1 c 1 ) ζ ζ . This completes the proof of Theorem 3. □
Remark 1.
Gao and Lenstra determined all optimal normal bases by using the Galois theory on finite fields [8] and consequently confirmed a conjecture that was raised by Mullin et al. Here, we give a direct proof of the Theorem 3 by using the mathematical induction.
Theorem 4.
Assume that 2 n + 1 is an odd prime number and Z 2 n + 1 * = 1 , 2 . Let R = GR ( 2 r , n ) ( r , n 2 ) . Then:
(1) If n 3 , there is no optimal normal basis for R / Z 2 r .
(2) If n = 2 and α R = GR ( 2 r , 2 ) , B ( λ ) = { α , σ ( α ) } is an optimal normal basis for R / Z 2 r if and only if α is equivalent to ζ + ζ 1 + 2 b ( ζ 2 + ζ 2 ) , where ζ is a fifth primitive root of one in GR ( 2 r , 4 ) , so that ζ + ζ 1 R , and b is the unique element in Z 2 r 1 satisfying 1 b + 4 b 2 = 0 .
Proof. 
(1) First, we consider r = 2 . Suppose that α R = GR ( 4 , n ) , and B ( λ ) = { σ λ ( α ) : 0 λ n 1 } is an optimal normal basis for R / Z 4 . Then, B ( λ ) ¯ = { α ¯ 2 λ : 0 λ n 1 } is an optimal normal basis for F 2 n / F 2 . By Lemma 6, α ¯ is equivalent to ξ + ξ 1 , where ξ is a ( 2 n + 1 ) th primitive root of one in F q 2 . Let ζ be the ( 2 n + 1 ) th primitive root of one in GR ( 4 , n ) such that ζ ¯ = ξ . Then, ζ + ζ 1 R , and up to equivalence:
α = ζ + ζ 1 + 2 a ( a R ) .
Since { ζ 2 λ + ζ 2 λ : 0 λ n 1 } = { ζ i + ζ i : 1 i n } is a normal basis for R / Z 4 by the assumption that Z 2 n + 1 * = 1 , 2 , also, this tell us that a = i = 1 n c i ( ζ i + ζ i ) . Therefore, we know that:
α = ζ + ζ 1 + 2 i = 1 n c i ( ζ i + ζ i ) ( c i Z 2 ) ,
and:
σ λ ( α ) = ζ 2 λ + ζ 2 λ + 2 i = 1 n c i ( ζ i 2 λ + ζ i 2 λ ) ( 0 λ n 1 ) .
Let:
α σ λ ( α ) = i = 0 n 1 b λ i σ i ( α ) ( b λ i Z 4 , 0 λ n 1 ) .
We define:
M λ = { 0 i n 1 : b λ i 0 } .
Then, 2 n 1 = M ( B ( λ ) ) = λ = 0 n 1 M λ . Since:
α σ λ ( α ) ¯ = ( ξ + ξ 1 ) ( ξ 2 λ + ξ 2 λ ) = ξ 2 + ξ 2 , for λ = 0 ξ 2 λ + 1 + ξ ( 2 λ + 1 ) + ξ 2 λ 1 + ξ ( 2 λ 1 ) , for 1 λ n 1 .
We get M 0 1 and M λ 2 for 1 λ n 1 . Then, from λ = 0 n 1 M λ = 2 n 1 , we know that M 0 = 1 and M λ = 2 for 1 λ n 1 . However,
α σ 0 ( α ) = α 2 = ζ 2 + ζ 2 + 2 = σ ( α ) 2 i = 1 n c i ( ζ 2 i + ζ 2 i ) 2 ( i = 1 n ( ζ 2 i + ζ 2 i ) ) ( by ( 19 ) ) = σ ( α ) + 2 i = 1 n ( c i + 1 ) ( ζ 2 i + ζ 2 i ) = ( 1 + 2 ( c 1 + 1 ) ) σ ( α ) + 2 i = 2 n ( c i + 1 ) σ l i ( α ) ,
where l i is an integer determined by 0 l i n 1 and 2 l i 2 i o r 2 i ( mod 2 n + 1 ) so that l i 1 . From M 0 = 1 , we get c i = 1 Z 2 for all i , 2 i n . By (18), we have:
α = ( 1 + 2 c 1 ) ( ζ + ζ 1 ) + 2 ( c 1 Z 2 ) , ζ + ζ 1 = ( α + 2 ) ( 1 + 2 c 1 ) = ( 1 + 2 c 1 ) α + 2 ,
and:
α σ ( α ) = [ ( 1 + 2 c 1 ) ( ζ + ζ 1 ) + 2 ] [ ( 1 + 2 c 1 ) ( ζ 2 + ζ 2 ) + 2 ] = ζ + ζ 1 + ζ 3 + ζ 3 + 2 ( ζ + ζ 1 + ζ 2 + ζ 2 ) = ( 3 + 2 c 1 ) α + ( 1 + 2 c 1 ) σ λ ( α ) + 2 σ ( α ) ,
where λ is determined by 2 λ ± 3 ( mod 2 n + 1 ) and 0 λ n 1 . If n 3 , then λ 0 , 1 . Therefore, M 1 = 3 2 . Therefore, we proved that there is no optimal normal basis in the case n 3 .
(2) Letting α R = G R ( 2 r , 2 ) ( r 2 ) and B ( λ ) = { α , σ ( α ) } is an optimal normal basis for R / Z p r . By Lemma 6, we get:
α = ζ + ζ 1 + 2 ( c 1 ( ζ + ζ 1 ) + c 2 ( ζ 2 + ζ 2 ) ) = ( 1 + 2 c 1 ) ( ζ + ζ 1 ) + 2 c 2 ( ζ 2 + ζ 2 ) ,
where ζ is a fifth primitive root of one in G R ( 2 r , 4 ) , so that ζ + ζ 1 R and c 1 , c 2 Z 2 r 1 . Since 1 + 2 c 1 is invertible in Z 2 r , we can assume, up to equivalence,
α = ζ + ζ 1 + 2 b ( ζ 2 + ζ 2 ) , for b Z 2 r 1 .
Then, σ ( α ) = ζ 2 + ζ 2 + 2 b ( ζ + ζ 1 ) , so that:
ζ + ζ 1 = α 2 b σ ( α ) 1 1 2 b 2 b 1 = α 2 b σ ( α ) 1 4 b 2 , ζ 2 + ζ 2 = 1 α 2 b σ ( α ) 1 2 b 2 b 1 = σ ( α ) 2 b α 1 4 b 2
and by (20), we have:
α 2 = ζ 2 + ζ 2 + 2 + 4 b ( ζ + ζ 1 ) ( ζ 2 + ζ 2 ) + 4 b 2 ( ζ + ζ 1 + 2 ) = 2 4 b + 8 b 2 + 4 b 2 ( ζ + ζ 1 ) + ζ 2 + ζ 2 = ( ζ + ζ 1 ) ( 2 + 4 b 4 b 2 ) + ( ζ 2 + ζ 2 ) ( 1 + 4 b 8 b 2 ) = 2 + 4 b 4 b 2 1 4 b 2 ( α 2 b σ ( α ) ) + 1 + 4 b 8 b 2 1 4 b 2 ( σ ( α ) 2 b α ) = A α + B σ ( α ) ,
where ( 1 + 2 b ) A = 2 ( 1 b + 4 b 2 ) , ( 1 + 2 b ) B = 1 + 6 b 4 b 2 . Therefore, { α , σ ( α ) } is an optimal basis for R / Z 2 r if and only if A = 0 Z 2 r , and then, if and only if b Z 2 r 1 satisfies 1 b + 4 b 2 0 ( mod 2 r 1 ) .
Let Z ( 2 ) be the ring of two-adic integers. Consider f ( x ) = 1 x + 4 x 2 Z ( 2 ) [ x ] , f ( x ) = 1 + 8 x . We have v 2 ( f ( 1 ) ) = v 2 ( 4 ) = 2 and v 2 ( f ( 1 ) ) = v 2 ( 7 ) = 0 , where v 2 is the two-adic exponential valuation. From Hensel’s lemma and v 2 ( f ( 1 ) ) > 2 v 2 ( f ( 1 ) ) , we know that there exists unique b Z 2 r 1 such that 1 b + 4 b 2 = 0 for any r 2 . This completes the proof of Theorem 4. □
Putting Theorem 3 together with Theorem 4, we can derive the following results.
Theorem 5.
Let R = GR ( p r , n ) , r , n 2 . Then:
(1) There exists the optimal normal basis B ( α ) = { σ λ ( α ) : 0 λ n 1 } for R / Z p r if and only if (A) n + 1 and p are distinct prime numbers, and Z n + 1 * = p ; or (B) p = n = 2 .
(2) For Case (A), B ( α ) is an optimal normal basis for R / Z p r if and only if α is equivalent to an ( n + 1 ) th primitive root ζ of one. Namely, α = a ζ ( a Z p r * ) .
(3) For Case (B), B ( α ) is an optimal normal basis for GR ( 2 r , 2 ) / Z 2 r if and only if α is equivalent to ζ + ζ 1 + 2 b ( ζ 2 + ζ 2 ) , where ζ is a fifth primitive root of one in GR ( 2 r , 4 ) so that ζ + ζ 1 , ζ 2 + ζ 2 GR ( 2 r , 2 ) , and b Z 2 r 1 is the unique element satisfying 1 b + 4 b 2 = 0 .

Author Contributions

Conceptualization, K.F.; methodology, K.F. and A.Z.; validation, A.Z.; writing, original draft preparation, A.Z.; writing, review, K.F.; supervision, K.F.; funding acquisition, K.F.

Funding

This research was funded by the National Natural Science Foundation of China under Grants 11471178 and 11571107.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Ash, D.W.; Blake, I.F.; Vanstone, S.A. Low complexity normal bases. Discrete Appl. Math. 1989, 25, 191–210. [Google Scholar] [CrossRef]
  2. Ballet, S.; Chaumine, J.; Pieltant, J.; Rolland, R. On the tensor rank of multiplication in finite extensions of finite fields. J. Number Theory 2011, 128, 1795–1806. [Google Scholar] [CrossRef]
  3. Boztas, S.; Hammons, R.; Kumar, P.Y. 4-phase sequences with near-optimum correlation properties. IEEE Trans. Inf. Theory 1992, 38, 1101–1113. [Google Scholar] [CrossRef] [Green Version]
  4. Cascudo, I.; Cramer, R.; Xing, C.; Yang, A. Asymptotic bound for multiplication complexity in the extensio s of small finite fields. IEEE Trans. Inf. Theory 2012, 58, 4930–4935. [Google Scholar] [CrossRef]
  5. Christopolou, M.; Garefalakis, T.; Panario, D.; Thomson, D. Gauss periods as constructions of low complexity normal bases. Des. Codes Cryptogr. 2012, 62, 43–62. [Google Scholar] [CrossRef]
  6. Gao, S. Normal Bases over Finite Fields. Ph.D. Thesis, University of Waterloo, Waterloo, ON, Canada, 1993. [Google Scholar]
  7. Gao, S. Abelian groups, Gauss periods and normal bases. Finite Fields Appl. 2001, 7, 149–164. [Google Scholar] [CrossRef]
  8. Gao, S.; Lenstra, H.W. Optimal normal bases. Des. Codes Cryptogr. 1992, 2, 315–323. [Google Scholar] [CrossRef]
  9. Liao, Q. The Gaussian normal basis and its trace basis over finite field. J. Number Theory 2012, 132, 1507–1518. [Google Scholar] [CrossRef]
  10. Liao, Q.; Feng, K. On the complexity of the normal bases via prime Gauss period over finite fields. J. Syst. Sci. Complex. 2009, 22, 395–406. [Google Scholar] [CrossRef]
  11. Liao, Q.; You, L. Low complexity of a class of normal bases over finite fields. Finite Fields Appl. 2011, 17, 1–14. [Google Scholar] [CrossRef]
  12. Massey, J.L.; Omura, K. Computation Method and Apparatus for Finite Field Arithmatic. U.S. Patent 4587627, 6 May 1986. [Google Scholar]
  13. Hammons, A.R.; Kumar, P.V., Jr.; Calderbank, A.R. The Z4-linearity of Kerdock, Preparata, Goethals, and related codes. IEEE Trans. Inf. Theory 1994, 40, 301–319. [Google Scholar] [CrossRef]
  14. Helleseth, T.; Johansson, T. Universal hash functions from exponential sums over finite fields and Galois rings. In Advances in Cryptology-CRYPTO’ 96; Springer: Berlin/Heidelberg, Germany, 1996; pp. 31–44. [Google Scholar]
  15. Yamada, M. Gifference sets over Galois rings with odd extension degrees and characteristic an even power of 2. Des. Codes Cryptogr. 2013, 67, 37–57. [Google Scholar] [CrossRef]
  16. Yildiz, B. A combinatorial construction of the Gray map over Galois rings. Discrete Math. 2009, 309, 3408–3412. [Google Scholar] [CrossRef]
  17. Abrahamsson, B. Architectures for Multiplication in Galois Rings. Linköping, Sweden, 2004. Available online: http://www.ep.liu.se/exjobb/isy/ex/3549/ (accessed on 9 June 2004).
  18. Wan, Z.X. Lecture Notes on Finite Fields and Galois Rings; World Scientific: Singapore, 2003. [Google Scholar]
  19. Zhang, A.; Feng, K. A new criterion on normal bases for finite field extensions. Finite Fields Appl. 2015, 31, 25–41. [Google Scholar] [CrossRef]

Share and Cite

MDPI and ACS Style

Zhang, A.; Feng, K. Normal Bases on Galois Ring Extensions. Symmetry 2018, 10, 702. https://doi.org/10.3390/sym10120702

AMA Style

Zhang A, Feng K. Normal Bases on Galois Ring Extensions. Symmetry. 2018; 10(12):702. https://doi.org/10.3390/sym10120702

Chicago/Turabian Style

Zhang, Aixian, and Keqin Feng. 2018. "Normal Bases on Galois Ring Extensions" Symmetry 10, no. 12: 702. https://doi.org/10.3390/sym10120702

APA Style

Zhang, A., & Feng, K. (2018). Normal Bases on Galois Ring Extensions. Symmetry, 10(12), 702. https://doi.org/10.3390/sym10120702

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop