On the Linear Complexity of Legendre Sequences Over Fq
Qiuyan Wang, Dongdai Lin, Xuan Guang · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 2014
In this paper, the linear complexity and minimal polynomials of Legendre sequences over Fq have been calculated, where q = pm and p is a prime number. Our results show that Legendre sequences have high linear complexity over Fq for a large part of prime power number q so that they can resist the linear attack method.