Elsevier

Information Sciences

Volume 222, 10 February 2013, Pages 784-794
Information Sciences

A generalization of the Hall’s sextic residue sequences

https://doi.org/10.1016/j.ins.2012.07.048Get rights and content

Abstract

Let p be a prime with 6∣(p  1) and integer m  1. As a generalization of the Hall’s sextic residue sequences, we introduce some families of generalized cyclotomic binary sequences over the residue class ring modulo pm by defining sextic generalized cyclotomic residue classes. We determine the values of the linear complexity, which are large enough to resist security attacks using the Berlekamp–Massey algorithm. We also investigate the trace function representation for the resulting sequences when m = 2.

Introduction

Let p be an odd prime and integer m  1. We identify Zpm, the residue ring modulo pm, with the set {0, 1,  , pm  1}. We also denote by Zpm the set of unit elements of Zpm. Since Zpm is a cyclic group under the multiplicative operation, let g be one of its generators (or primitive elements). Then we haveZpm={gi:i=0,1,,φ(pm)},where φ(−) is the Euler totient function. By defining different partitions of Zpm, the ring Zpm is extensively applied to constructing pseudorandom sequences in the literature. A typical partition is the (generalized) cyclotomic classes, see below for the definition.

In this paper, we always suppose that g is a primitive element modulo p2. We note that in this case g is a primitive element modulo pn for any n  1 [16]. That is, the order of g in Zpn is ordpn(g)=φ(pn)=pn-1(p-1). Let d be an even integer satisfying d∣(p  1). Now for each n, we get the (generalized) cyclotomic classes of Zpn by definingD0(n)=(gd)=gdk(modpn):k=0,1,,φ(pn)d-1,Dl(n)=glD0(n)=glx(modpn):xD0(n),l=1,,d-1,which give a partition of Zpn. LetR(n)=pZpn-1={0,p,2p,,(pn-1-1)p},we haveZpn=ZpnR(n)=D0(n)D1(n)Dd-1(n)R(n).Thus we represent the ring Zpm as followsZpm=D0(m)D1(m)Dd-1(m)pZpm-1=D0(m)pD0(m-1)Dd-1(m)pDd-1(m-1)p2Zpm-2=n=1mpm-nD0(n)n=1mpm-nDd-1(n){0}.Assume thatCl=n=1mpm-nDl(n),l=0,1,d-1,then we haveZpm=i=0d-1Ci{0}andCiCj=,ij,i,j=0,,d-1,where ∅ denotes the empty set.

So one can construct a pm-periodic binary sequence {st}t⩾0 by definingst=1,ift(modpm)C0Cd2-1,0,otherwise,t0,where C0Cd2-1 is called the characteristic set of {st}t⩾0. We note that {st}t⩾0 is called a cyclotomic sequence for m = 1 or a generalized cyclotomic sequence for m  2. Some special cases have been investigated in the literature, see Table 1, in which the symbol “√” means that the trace function representation of the corresponding sequences has been investigated.

In this paper, we will consider {st}t⩾0 defined in (2) and its related sequences when m  1 and d = 6.

Definition 1

Let distinct integers u,v,wZ6={0,1,,5}, which is the residue class ring modulo 6. The triple subset {u,v,w} is admissible over Z6 if there exists an Z6 such that{u+(mod6),v+(mod6),w+(mod6)}=Z6{u,v,w}.

One can easily verify that all admissible triples over Z6 are{0,1,2};{1,2,3};{2,3,4};{3,4,5};{4,5,0};{5,0,1};{1,3,5};{0,2,4}.

Proposition 1

Each admissible triple {u, v, w} over Z6 satisfies{u,v,w,u+3(mod6),v+3(mod6),w+3(mod6)}=Z6.

Proof

Clearly. 

Now we introduce the new sequences. Let A be the set of all admissible triples over Z6.

Definition 2

Let p = 6f + 1 be a prime and m  1. Using Cl in (1) with d = 6, we construct a pm-periodic binary sequence {et}t⩾0 by defininget=1,ift(modpm)CuCvCw,0,otherwise,t0,where (u,v,w)A{{0,2,4},{1,3,5}}.

We remark that if {u, v, w} = {0, 2, 4} or {1, 3, 5}, {et}t⩾0 was considered in  [18], [12]. So we exclude them here. Clearly {et}t⩾0 is a generalization and modification of the Hall’s sequences[9], [10]. We will present the linear complexity and trace function representation for {et}t⩾0.

Section snippets

Linear complexity

Let Fq be the finite field of q elements. We recall that the linear complexity L(s) of an N-periodic binary sequence {st}t⩾0 is the least order L of a linear recurrence relation over F2st+L=cL-1st+L-1++c1st+1+c0stfort0which is satisfied by {st}t⩾0. And the polynomialMs(x)=xL+cL-1xL-1++c0F2[x]is called the minimal polynomial of {st}t⩾0. The generating polynomial of {st}t⩾0 is defined byS(x)=s0+s1x+s2x2++sN-1xN-1F2[x].It is easy to seeMs(x)=(xN-1)/gcd(xN-1,S(x)),henceL(s)=deg(Ms(x))=N-deg(

Trace representation (m = 2)

For applications, pseudorandom sequences should be implemented efficiently. Trace function is extensively applied to producing pseudorandom sequences and analyzing their pseudorandom properties. The trace function from F2s to F2 is defined byTr1s(x)=i=0s-1x2i,xF2s.We refer the readers to[15] for details.

In this section, we present a trace function representation for {et}t⩾0 defined as in Definition 2 when m = 2. The case of m > 2 seems more complicated, although it might be extended directly from

Final remarks

Cryptographically strong sequences should have an ideal balance property, long periods, large linear complexity, low correlation, etc. [4]. In this paper, we have constructed families of binary sequences of period pm over Zpm. The difference between the number of 0’s and the number of 1’s is 1 in such sequences, i.e., the sequences have optimum balance among 0’s and 1’s. The linear complexity is large enough since it can resist attacks using the Berlekamp–Massey algorithm [2], which tells us

Acknowledgments

The authors thank the anonymous referees for their valuable comments. The third referee analyzed the paper in details and pointed out Lemma 6 to clarify and simplify our proofs, we are very grateful for that too.

X.N.D. was partially supported by the National Natural Science Foundation of China under Grant 61063041, 61202395 and 61163038, the Program for New Century Excellent Talents in University, the Scientific Research Foundation of the State Human Resource Ministry and the Education Ministry

References (19)

There are more references available in the full text version of this article.

Cited by (16)

View all citing articles on Scopus
View full text