An analysis of parallel pseudo-random sequences
Ben Zhaorong Xiao Guozhen
The result of R.S. Safavi-Naini is generalized.It is proved that exponent sequences overany finite fields with equal order have the same property.The period and linearcomplexity ofeach component sequences is analysed,and the upper bound 2￣n -2￣(n-n+1)-1 of the correlationfunction value of each component sequence is obtained. From the distribution of their correla-tion value , it can be deduced that the exponent sequenceis not a good sequence in cryptology.